基于动态克隆选择的记忆检测器更新算法

记忆细胞在再次检测到相同或相似的抗原时能迅速活化,产生大量抗体,并进行快速免疫应答.在基于人工免疫的入侵检测中,利用此特性对检测器生命周期进行模拟,可大大提高入侵检测系统的性能.文章在分析动态克隆选择算法模型中记忆检测器生成过程的基础上,提出一种记忆检测器更新算法,对记忆检测器的个数设定最大值,避免出现随着时间的推移产...     

基于切割的检测器生成与匹配算法

 检测器生成和匹配算法直接影响到人工免疫系统的检测效率和非法抗原的检测率.为了改进现有算法存在的生成检测器与识别非法抗原的时间和空间开销较大、对非法抗原检测率较低等问题,本文提出基于切割的检测器生成与匹配算法.针对现有检测器表示方法存在的缺陷,用正超立方体表示检测器,为减少匹配算法的时间和空间开销提供了基础;依据空间包含关系设计基于空间包含的匹配算法,减少了选择检测器和检查抗原的时间和空间开销,使得分析检测器所覆盖的非法抗原较方便;依据自体在论域空间的分布,引入切割空间的方法生成检测器,消除所生成检测器间的冗余信息,减少了检测漏洞,使得所生成的检测器具有较高的非法抗原检测率和检测效率.文中建立了算法的原型系统,构造不同类型的数据集,测试识别非法抗原所需的检测器数量,以及当系统中保存不同数量的检测器时所具有的非法抗原检测率,与现有算法进行比较,验证了基于切割的检测器生成与匹配算法能有效的提高否定选择算法的性能.     

基于矩阵特征值分解的MIMO天线选择算法

天线子集选择技术是一种有效的低代价且能够获得MIMO好处的技术.文中提出了一种基于矩阵特征值分解的天线选择算法以最大化信道容量,它将大的搜索空间分成若干小区间,在较小的搜索空间中采用穷举法.分析了所提算法及相关算法的计算复杂度.仿真实验表明,该算法能够获得接近穷举法的中断容量性能而且具有较低的计算复杂度.     

改进的否定选择算法在入侵检测系统中的应用

人工免疫系统中的一个重要的核心算法就是否定选择算法(Negative Select Algorithm),该算法用来生成成熟检测器,它是对免疫细胞成熟过程的模拟。否定选择算法的检测器是随机生成的,因此检测器集合冗余度高、对非自体空间的覆盖率低。针对这一问题,本文提出一种改进算法,通过对检测器进行二次筛选来降低检测器的重复率和冗余度。实验证明,在基于免疫原理的入侵检测模型中改进算法可以将模型的正确检测率提高10%,漏检率降低3%,该算法是有效的。     

多样性检测器生成算法研究

文章基于小生境策略的否定选择算法利用在搜索空间中计算检测器之间的海明距离,构建小生境;定义适应度函数与亲合力函数相关,更客观地反映检测器的检测能力;利用进化策略,进行遗传操作,而生成多样性和通用性的最佳检测器集。同时该算法可以减少生成检测器的时间开销。     

一种基于复杂网络免疫策略的检测器进化算法

在基于小生境策略的检测器生成算法基础上,借鉴复杂网络的免疫策略,对成熟检测器的进化过程进行改进,提出一种基于复杂网络免疫策略的检测器进化算法,利用亲和力函数优化父代检测器的选择,避免了解所有个体的特征信息,保持了选取与非自体模式较高亲和力的可能性。通过仿真实验对比并分析两种算法的漏检率、误检率以及数据编码较长情况下对性能的影响。从实验结果来看,该算法基本达到设计目标。     

医用电子技术与设备

0324236负选择模型中初始检测器集的一个生成算法[刊]/吴作顺//电子学报.—2003,31(5).—687～689(L)0324237激光—光化治疗的国内外应用研究进展[刊]/凌一鸣//电子器件.—2003,26(2).—107～110(L)介绍了弱激光治疗和光动力治疗的机制以及它的研究进展。氦氖激光照射人体血液,可以增加血球的溶血率,改善血液载氧能力,降低血沉和粘度。光动力     

基于人工免疫原理的入侵检测系统

文章针对前人的免疫IDS模型，改进了动态克隆选择算法与基因库相结合的入侵检测方法。设计了一种self集的确定方法，采用分段匹配的方法，利用人体免疫细胞抗体生成的机制将细胞分为记忆细胞、成熟细胞和未成熟细胞，改进了基于基因库进化、高突变与否定选择相结合的成熟检测器生成算法。     

基于人工免疫算法的异步电机故障诊断研究

人工免疫算法的模型为异步电机故障诊断研究提供了新的视角和算法模型。本文的主要研究对象是基于阴性选择算法的异步电机故障诊断方法。基于免疫系统的原理,电机故障诊断即为检测"非已",检测非正常状态下的电机特征信号。首先通过正常电机特征信号生成"自己",再通过阴性选择生成信号检测器,将检测器与被测电机设备特征信号进行匹配,根据匹配关系便能诊断电机的故障。本文还将阴性选择算法进一步优化,在阴性选择基础上加以克隆优化,从而产生更合适的检测器。通过2种方法对同一故障进行诊断,可直观地看出优化后模型准确率的提高。     

基于改进RX增量学习的高光谱图像异常检测

高光谱图像的异常检测是星上处理中重要的研究内容之一,提出了一种在传统RX算法基础上结合增量学习和层级化的高光谱图像异常检测方法.采用增量学习,当生成新的协方差矩阵时不需要计算所有样本的协方差矩阵即可对检测器模型进行更新,避免了数据的重复计算和逆矩阵的求解.利用层级化方法有效地抑制背景,提取目标光谱,增强了检测器的性能....     

最大阵元利用率MIMO雷达阵列优化快速算法

针对MIMO雷达最大阵元利用率阵列结构优化算法中使用穷举搜索运算量太大的问题,提出了一种快速算法。该算法在只包含两个阵元的最优阵列基础上,通过迭代的方式向前一个最优阵列增加一个新阵元来寻找包含指定阵元数的最优阵列。文中对该算法的有效性进行了证明,并与穷举搜索方法做了复杂度比较。理论分析和仿真实验表明,该算法能够显著降低运算量,尤其在阵元数目较大时具有明显优势。并且,在阵元数一定的情况下,所得到的优化阵列与穷举搜索的结果具有等同的性能。     

Multiuser Detection Based on Adaptive LMS and Modified Genetic Algorithm in DS-CDMA Communication Systems

In this paper, we present an efficient evolutionary algorithm for the multi-user detection (MUD) problem in direct sequence-code division multiple access (DS-CDMA) communication systems. The optimum detector for MUD is the maximum likelihood (ML) detector, but its complexity is very high and involves an exhaustive search to reach the best fitness of transmitted and received data. Thus, there has been considerable interest in suboptimal multiuser detectors with less complexity and reasonable performance. The proposed algorithm is a combination of adaptive LMS Algorithm and modified genetic algorithm (GA). Indeed the LMS algorithm provides a good initial response for GA, and GA will be applied for this response to reach the best answer. The proposed GA reduces the dimension of the search space and provides a suitable framework for future extension to other optimization algorithms. Our algorithm is compared to ML detector, Matched Filter (MF) detector, conventional detector with GA; and Adaptive LMS detector which have been used for MUD in DS-CDMA. Simulation results show that the performance of this algorithm is close to the optimal detector with very low complexity, and it works better in comparison to other algorithms.     

Joint data detection and channel estimation for OFDM systems

We develop new blind and semi-blind data detectors and channel estimators for orthogonal frequency-division multiplexing (OFDM) systems. Our data detectors require minimizing a complex, integer quadratic form in the data vector. The semi-blind detector uses both channel correlation and noise variance. The quadratic for the blind detector suffers from rank deficiency; for this, we give a low-complexity solution. Avoiding a computationally prohibitive exhaustive search, we solve our data detectors using sphere decoding (SD) and V-BLAST and provide simple adaptations of the SD algorithm. We consider how the blind detector performs under mismatch, generalize the basic data detectors to nonunitary constellations, and extend them to systems with pilots and virtual carriers. Simulations show that our data detectors perform well.     

Improved layered MIMO detection algorithm with near-optimal performance

A new layered symbol detection algorithm for multiple-input multiple-output systems is presented. In this scheme, the layers are divided into two groups and detected differently. For the layer with the smallest post-detection signal-to-noise ratio, an exhaustive search is performed over the signal constellation; for the remaining layers the conventional iterative vertical Bell laboratories layered space-time (V-BLAST) technique is utilised. The proposed algorithm also uses a different symbol detection ordering from that recommended in the original V-BLAST algorithm. Simulation results show that the error rate performance of the proposed detection algorithm approaches closely that of an optimal maximum likelihood detector with no reduction in the symbol detection throughput, while the computational complexity is less than |Q| times that of V-BLAST, where |Q| is the cardinality of signal constellation Q.     

四象限探测仪测角新算法

实验结果表明,传统的四象限探测仪测角算法具有较大的误差。既使落在各个象限的光斑面积均未到饱和,最大误差也在二十角秒以上。本文给出一种新的四象限测角仪测角算法,这种算法不仅可用于在线测量,而且可使最大测量误差降低到2.3761角秒。     

一种基于约束最小误码率的多用户检测算法

针对多用户检测器误码率函数具有多个局部极小点的缺陷,本文提出一组新的约束条件,在约束的检测器解空间里,误码率函数具有唯一的最小点.同时,本文还提出了一种有效的阻碍共轭梯度算法来求解约束最小点.仿真结果表明,本文的提出的约束最小误码率检测器性能接近理想的线性最小误码率检测器,明显优于最小均方误差检测器.     

Optimal grouping algorithm for a group decision feedback detector in synchronous CDMA communications

The group decision feedback (GDF) detector is studied in this letter. Given the maximum group size, a grouping algorithm is proposed. It is shown that the proposed grouping algorithm maximizes the symmetric energy of the multiuser detection system. Furthermore, based on a set of lower bounds on asymptotic group effective energy (AGEE) of the GDF detector, it is shown that the proposed grouping algorithm, in fact, maximizes the AGEE lower bound for every group of users. The theoretical analysis of the grouping algorithm enables the offline estimation of the computational cost and the performance of a GDF detector. The computational complexity of a GDF detector is exponential in the largest size of the groups. Simulation results are presented to verify the theoretical conclusions. The results from this letter can be applied to the decision feedback detector by setting the maximum group size to one.     

Selection of Minimal Test Points Set for Integer-Coded Fault Wise Table

Test points selection for integer-coded fault wise table is a discrete optimization problem. On one hand, traditional exhaustive search method is computationally expensive. On the other hand, the space complexity of traditional exhaustive is low. A tradeoff method between the high time complexity and low space complexity is proposed. At first, a new fault-pair table is constructed based on the integer-coded fault wise table. The fault-pair table consists of two columns： one column represents fault pair and the other represents test points set that can distinguish the corresponding faults. Then, the rows are arranged in ascending order according to the cardinality of corresponding test points set. Thirdly, test points in the top rows are selected one by one until all fault pair are isolated. During the test points selection process, the rows that contain selected test points are deleted and then the dimension of fault-pair table decreases gradually. The proposed test points selection algorithm is illustrated and tested using an integercoded fault wise table derived from a real analog circuit. Computational results suggest show policies are better than the exhaustive strategy.     

基于压缩传感的光子计数成像系统

提出了一种基于压缩传感理论的光子计数成像系统。该系统以单光子计数器作为探测元件,以期在面元探测技术不甚成熟的现状下用点探测器进行极弱光探测。通过计算机模拟计算,验证了压缩传感理论结合单光子计数器应用于极弱光成像的可行性,讨论了单光子计数器的暗计数率、量子效率和测量噪声对成像质量的影响。介绍了压缩传感理论,为了获得更好的图像质量和更快的计算速度,提出了SpaRSA-DWT稀疏重建算法,并与传统的IWT算法进行对比。给出了两种算法下,迭代次数、测量数、噪声功率分别与获得图像信噪比的关系曲线,证明了SpaRSA-DWT算法的优越性。     

An MBER–BLAST algorithm for OFDM–SDMA communication using particle swarm optimization

A multiple antenna‐aided, minimum bit error rate–Bell Laboratories‐layered space–time (MBER–BLAST) multiuser detection algorithm is proposed for uplink orthogonal frequency division multiplexing–space division multiple access (OFDM–SDMA) communication to increase the capacity of the system. The proposed algorithm overcomes the limitations of the conventional detectors when the number of users exceed the number of receiver antennas. A particle swarm optimization (PSO) algorithm is employed for finding the optimum weight vectors for MBER detector. PSO is well suited for physically realizable, real‐time applications, where low complexity and fast convergence are of absolute importance, while an optimum maximum likelihood (ML) detection using an exhaustive search method is prohibitively complex. The proposed algorithm outperforms the MBER detector and is capable of achieving performance close to that attained by ML detector at a significantly lower complexity, especially under high user loads. Simulation results show that MBER–BLAST detector promises substantially improved performance compared with the existing systems and offers a good performance–complexity trade‐off. It supports a large number of users by exploiting the capacity advantages of multiple antenna systems in rich scattering environments. Copyright © 2010 John Wiley & Sons, Ltd.