基于目标优先级的增量式雷达辐射源信号参数识别方法

陆、海、空的战场侦察、监视、定位和跟踪等应用领域产生了海量、动态增加的雷达辐射源信号参数侦察数据。传统雷达辐射源信号参数分析方法无法高效利用新侦察数据,以提高雷达辐射源识别能力,特别是难以应对高威胁级别的辐射源目标的识别。提出一种基于目标优先级别的增量式雷达辐射源信号参数分析方法,能够有效针对新辐射源信号参数侦察数据进行增量式学习,大大提高高威胁雷达辐射源目标的识别能力。仿真实验证实了该方法的有效性。     

基于双谱的雷达辐射源识别

针对当前复杂电磁环境下电子侦察中雷达辐射源识别困难的问题,提出了一种基于双谱分析和势函数分类识别雷达辐射源的新方法。首先用Hinich方法检验雷达辐射源信号,发现其具有非线性特性。然后用适合处理该类信号的双谱分析法提取信号的双谱对角切片,利用主成分分析法(PCA)从大量训练样本特征中挑选低维、低复杂度的特征矢量,并融合对分类具有显著贡献的辐射源属性参数作为识别特征矢量。最后采用势函数分类法实现雷达辐射源识别。仿真结果表明,基于双谱的识别法对噪声不敏感,对不同脉内调制的辐射源信号识别率达到了92.9%,该方法为决策层提供了识别不同雷达辐射源的新途径。     

Transformer网络在雷达辐射源识别中的应用

由于雷达辐射源信号在时序上具有强相关性,针对卷积神经网络难以提取信号的时序逻辑相关性特征的缺点,本文提出了基于Transformer网络的雷达辐射源个体识别的方法。该方法首先以3台信号发生器模拟雷达辐射源信号,同时采集数据并建立数据库;然后对原始信号提取相位特征以及包络特征;最后采用基于注意力机制的Transformer网络对信号进行进一步的特征提取并分类。实验结果表明,该算法对于包络特征以及相位特征敏感度不同,同时数据样本长度对于识别效果会产生影响,最终结合相位特征的网络模型在信噪比为15 dB时识别率可以达到98.9%。     

粗糙K-means和AdaBoost结合的雷达辐射源快速识别算法

针对数据集识别难度分布不均匀,提出了基于粗糙K-means和AdaBoost的雷达辐射源快速识别算法。该算法由2个阶段构成:初级识别阶段提出一种改进粗糙K-means算法,将数据特征空间分割为确定区域、粗糙区域和不确定区域,构建雷达辐射源快速识别算法模型,对数据集进行筛选和识别,同时提出了一种确定粗糙K-means算法初始聚类中心和聚类数量以解决其固有缺陷的思路;在高级识别阶段,基于粗糙区域已知数据训练的多类AdaBoost分类器识别不确定区域未知数据,提升识别精度。仿真结果表明:该算法与RBF-SVM和AdaBoost相比,精度浮动在-0.1%到+1.4%之间,训练时间和测试时间分别最大缩短0.857s和0.005s,在保持了较高识别精度和泛化能力的同时,明显降低了计算复杂度,缩短了耗时,提供了设计雷达辐射源快速识别算法的新思路。     

雷达辐射源信号双谱估计的物理意义及其辐射源个体识别

针对目前研究中雷达辐射源信号双谱物理意义不明确的问题,给出偏态这一物理概念,并给出雷达辐射源信号偏态的具体表现形式.针对雷达辐射源个体识别,提出应用围线积分双谱估计波形熵和围线积分双谱估计能量熵组成的二维特征向量用于后续的分类识别.在分类识别中,应用分析性能良好的模糊C-均值(FCM)聚类方法,对提取出的二维特征向量加以聚类分析,从而完成在一定信噪比下对雷达辐射源个体的识别.最后,通过仿真实验和实测实验验证本文所述方法的正确性和可行性.     

基于模糊函数主脊切片和深度置信网络的雷达辐射源信号识别

雷达辐射源信号识别是电子侦察系统的关键组成部分,为了提高低信噪比条件下对低截获概率雷达信号识别的准确率,提出了一种基于模糊函数主脊切片(MRSAF)与深度置信网络(DBN)的雷达辐射源信号识别方法。首先对雷达信号进行奇异值分解(SVD)进行降噪预处理,求解雷达信号的模糊函数并提取其主脊切片包络,采用奇异值分解方法降低噪声对主脊切片包络的影响,然后建立基于受限波尔兹曼机的DBN模型并运用标签数据有监督微调模型参数完成训练,最后基于该算法模型实现辐射源信号的分类和识别。仿真结果表明:该方法在低信噪比条件下也有较高的识别率,信噪比高于-4dB时,识别率可以达到90%以上,验证了本算法的有效性和应用价值。     

基于BP网的雷达辐射源分类器设计

为了提高侦察告警设备中雷达辐射源识别模块的正确识别率，设计了一种基于BP（Back Propagation）网络的雷达辐射源分类器，并就设计关键点——分类器拓扑结构、训练次数的确定以及训练集的设计进行了研究。分类器以BP网络为基础，以载频、脉宽、重频和天线扫描方式为输入特征向量对雷达辐射源进行分类。实验结果证明，该分类器能够对6种不同功能的雷达进行较好的分类，     

基于粗糙集和灰关联理论多传感器融合的雷达辐射源信号识别研究

粗糙集理论的上下近似集合可以刻画传感器对未知雷达辐射源信号的识别程度。从灰关联理论对传感器测得的原始数据计算出的不肯定度出发,计算每个目标与传感器测得的悲观解和乐观解距离。从而计算出目标与悲观解和乐观解间的灰关联系数矩阵。用假定的折中系数α、β计算出各传感器的侦察权重。再由灰关联系数矩阵和传感器权重得到各雷达辐射源信号的与悲观解和乐观解在传感器Sj识别意义下的灰关联度,最后计算融合判别函数得到融合结果。仿真实验表明,由粗糙集理论和灰关联理论相结合的多传感器数据融合的方法可以有效地应用于雷达辐射源信号识别,特别在是在降低多传感器引起的不确定性取得较好的效果。     

基于膜粒子群算法的雷达辐射源信号多目标特征选择方法研究

针对粒子群算法易陷入局部最优和收敛性能较差问题,受膜计算优化理论启发,提出1种膜框架下的粒子群算法,用于解决无监督的多目标雷达辐射源信号特征选择问题.在表层膜中,采用非支配排序和拥挤距离机制使算法既保留了多目标粒子群优化算法的快速收敛性,同时使用基本膜的进化规则也使解集具备较好的多样性,避免了过早收敛问题.在雷达辐射源信号特征提取中,利用一阶差分自相关方法提取包络特征,采用相关度和冗余度两个目标优化数据对象,以评价雷达辐射源信号特征子集的质量,并应用于雷达辐射源信号的脉内特征选择.实验结果表现出算法具有较好的可聚类性和全局收敛性,特征信号之间明显可分,边界清晰无交叠,获得了更高的雷达源信号分选识别正确率.     

基于信号“指纹”特征的雷达辐射源识别

在电子对抗领域,正确识别雷达脉冲信号是电子对抗侦察的重点也是难点。针对雷达脉冲信号具有很好的稳定性、普遍性和唯一性的包络上升沿特征("指纹"),通过使用宽带数字接收、信号分选与跟踪、数字正交混频等技术即时提取包络上升沿波形,并计算与"指纹"模板的Hausdorff距离,达到识别并匹配雷达辐射源的目的。在操作过程中,通过分析实际现象对Hausdorff距离的计算时机以及应用方式做出了正确的修改。通过大量实验验证了所提方法可以有效地识别出信号所对应的雷达辐射源个体。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.