针对细微特征进行K-means聚类的电台分选识别技术

现代战场中的无线通信设备日益增多，精准获取个体信息已成为研究热点，但也是难点。针对通信电台，提出了一种分选识别技术。该技术从电台物理层特性出发，对其辐射信号的细微特征进行K-means聚类以实现分选，分选的同时提取各个个体的特征属性值，未知信号通过与特征属性值相关运算实现个体识别。该技术无需先验知识，无需训练运算，通过实验验证，其可行、高效，易于工程实现。     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

基于归一化水体指数及其阈值自适应算法的水体遥感反演效果分析

归一化水体指数（NDWI）是水体遥感反演的一种重要指标，其阈值及修正直接影响反演结果的精度。基于Landsat-8与GF-1光学多光谱影像，使用归一化水体指数法阈值0（TH₀）、最大类间方差法（OTSU）自适应阈值（TH_otsu）与均值漂移聚类算法（Mean-Shift）自适应阈值（TH_MS）分别对典型正常水体、云雾覆盖水体、富营养化水体、高含泥沙水体进行水体遥感提取与效果分析，结果表明：正常水体以TH₀为阈值提取精度最高，THMS提取精度次之，TH_otsu提取精度最差；而云雾覆盖水体、富营养化水体以及含泥沙水体使用THMS提取精度最高，尤其少量云雾覆盖下的水体，TH_MS具有更明显的优势，TH₀提取精度次之，TH_otsu提取精度最差；对于不同的阈值，Land?sat-8比GF-1总体表现出更高的水体提取精度。Mean-Shift算法应用于NDWI阈值修正与水体遥感反演具有快速、水质适应性强、效果稳定的优势，对尤其是复杂条件下的水体信息遥感反演具有较好的提取效果。     

聚类混合型数据的密度峰值改进算法

聚类混合型数据，通常是依据样本属性类别的不同分别进行评价。但这种将样本属性划分到不同子空间中分别度量的方式，割裂了样本属性原有的统一性；导致对样本个体的相似性评价产生了非一致的度量偏差。针对这一问题，提出以二进制编码样本属性，再由海明差异对属性编码施行统一度量的新的聚类算法。新算法通过在统一的框架内对混合型数据实施相似性度量，避免了对样本属性的切割，在此基础上又根据不同属性的性质赋予其不同的权重，并以此评价样本个体之间的相似程度。实验结果表明，新算法能够有效地聚类混合型数据；与已有的其他聚类算法相比较，表现出更好的聚类准确率及稳定性。     

四川盆地龙女寺构造龙王庙组储层特征及地震响应

2005年威远构造威寒1井龙王庙组获11×10⁴ m³/d的测试产量揭示了四川盆地内部龙王庙组勘探的突破。随着勘探的深入，川中磨溪—高石梯地区多口百万立方米气井的获得证实了龙王庙组巨大的勘探潜力。然而，龙女寺构造龙王庙组储层发育情况展现出与磨溪—高石梯（高磨主体）地区较大的差异，以传统“亮点”反射模式作为储层预测的指导思想已经无法满足现今勘探的需要。以龙女寺构造龙王庙组储层为例，借助已有岩心、薄片、测录井及地震资料，对区内龙王庙组储层与高磨主体地区龙王庙组储层进行对比研究，同时对储层的地震响应进行进一步的探索。研究表明：研究区龙王庙组发育局限台地沉积，颗粒滩相作为储层发育的最有利相带，最主要的储集岩类为颗粒云岩及晶粒云岩，储集空间包括粒间（溶）孔、晶间（溶）孔、溶洞等；研究区内储层表现出低孔低渗的特征，非均质性强，纵向展布差异大，横向可对比性差。对比分析“亮点”反射模式，采用波形聚类属性对储层进行平面分布预测，明确不同储层发育情况对应的波形特征。I类波形对应于储层发育于顶部，储层厚度>30 m；II类波形对应于储层发育于中部，储层厚度>20 m，或顶部中部发育2套相距20 m左右、厚度15 m左右的储层；I、II类波形为储层发育有利波形；III类波形对应储层较薄（<5 m）且储层呈薄互层状发育或储层欠发育；IV类波形对应储层欠发育；III、IV类波形为储层发育不利波形。该方法可有效地规避“假亮点”反射，预测结果与沉积相发育特征及实钻井储层发育情况吻合率高。     

Stochastic geometry of network of randomly distributed moving vehicles on a highway

Vehicular ad hoc networks (VANETs) have become an extensively studied topic in contemporary research. One of the fundamental problems that has arisen in such research is understanding the network statistical properties, such as the cluster number distribution and the cluster size distribution. In this paper, we analyze these characteristics in the case in which vehicles are located on a straight road. Assuming the Rayleigh fading model and a probabilistic model of intervehicle distance, we derive probabilistic distributions of the aforementioned connectivity characteristics, as well as distributions of the biggest cluster and the number of disconnected vehicles. All of the results are confirmed by simulations carried out for the realistic values of parameters.     

Parallel Multipopulation Differential Evolutionary Particle Swarm Optimization for Voltage and Reactive Power Control

This paper presents parallel multipopulation differential evolutionary particle swarm optimization (DEEPSO) for voltage and reactive power control (VQC). The problem can be formulated as a mixed integer nonlinear optimization problem and various evolutionary computation techniques have been applied to the problem including PSO, differential evolution (DE), and DEEPSO. Since VQC is one of the online controls, speed‐up of computation is required. Moreover, there is still room for improvement in solution quality. This paper applies parallel multipopulation DEEPSO in order to speed up the calculation and improve solution quality. The proposed method is applied to IEEE 30, 57, and 118 bus systems. The results indicate that the proposed method can realize fast computation and minimize more active power losses than the conventional evolutionary computation techniques.     

绿色住区参数化优化设计平台的开发进展与展望

绿色住区设计是建设宜居城市和实现节能减排目标的重要手段与方法。文章首先回顾绿色住区参数化优化设计方法及平台概况，在此基础上，重点介绍平面生成、噪声计算、通风计算、可视度计算等新增功能和天空遮挡算法升级，以及广州市的工程应用，最后展望平台研发与应用的未来发展方向。     

基于变压器最优漏磁信息的绕组变形分类方法

为了判别电力变压器绕组变形状况,提出一种基于最优漏磁信息及多层聚类编码和最优权重译码的ECOC分类器对变压器绕组变形分类的方法,首先利用多层聚类算法构建最优ECOC编码矩阵,然后通过最优权重译码算法对分类器输出进行译码得出变压器绕组具体变形类别,建立变压器绕组二维漏磁场有限元模型,计算得出绕组可能出现的变形形式和绕组区域变形前后的磁感应强度值数据,从而得出磁感应强度测量点;最后利用所建立模型得出的绕组变形数据进行仿真判别。结果表明,所建立的分类器在绕组变形判别时具有较高的准确性,可用于变压器绕组变形类型的检测。     

A novel graph-based clustering method using noise cutting

Recently, many methods have appeared in the field of cluster analysis. Most existing clustering algorithms have considerable limitations in dealing with local and nonlinear data patterns. Algorithms based on graphs provide good results for this problem. However, some widely used graph-based clustering methods, such as spectral clustering algorithms, are sensitive to noise and outliers. In this paper, a cut-point clustering algorithm (CutPC) based on a natural neighbor graph is proposed. The CutPC method performs noise cutting when a cut-point value is above the critical value. Normally, the method can automatically identify clusters with arbitrary shapes and detect outliers without any prior knowledge or preparatory parameter settings. The user can also adjust a coefficient to adapt clustering solutions for particular problems better. Experimental results on various synthetic and real-world datasets demonstrate the obvious superiority of CutPC compared with k-means, DBSCAN, DPC, SC, and DCore.