针对细微特征进行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.     

Understanding the asymmetric perceptions of smartphone security from security feature perspective: A comparative study

Smartphones are being used and relied on by people more than ever before. The open connectivity brings with it great convenience and leads to a variety of risks that cannot be overlooked. Smartphone vendors, security policy designers, and security application providers have put a variety of practical efforts to secure smartphones, and researchers have conducted extensive research on threat sources, security techniques, and user security behaviors. Regrettably, smartphone users do not pay enough attention to mobile security, making many efforts futile. This study identifies this gap between technology affordance and user requirements, and attempts to investigate the asymmetric perceptions toward security features between developers and users, between users and users, as well as between different security features. These asymmetric perceptions include perceptions of quality, perceptions of importance, and perceptions of satisfaction. After scoping the range of smartphone security features, this study conducts an improved Kano-based method and exhaustively analyzes the 245 collected samples using correspondence analysis and importance satisfaction analysis. The 14 security features of the smartphone are divided into four Kano quality types and the perceived quality differences between developers and users are compared. Correspondence analysis is utilized to capture the relationship between the perceived importance of security features across different groups of respondents, and results of importance-satisfaction analysis provide the basis for the developmental path and resource reallocation strategy of security features. This article offers new insights for researchers as well as practitioners of smartphone security.     

Multiple material domain‐based computational tools for ease assessment of modal parameter in photonic crystal fibers

We report here the development of two computational tools PCFPS (Photonic Crystal Fiber Parameter Study) and PCFPA (Photonic Crystal Fiber Parameter Analysis), equipped with graphical user interface (GUI) for modeling of photonic crystal fiber. The tools are based on different structural parameters, and they provide characteristic analysis of the modal parameters from the structural parameters. The main feature of PCFPS is that it enables the user to find out the values of each defining modal parameter that has an immense contribution towards the manufacture of photonic crystal fiber. Additionally, PCFPA allows the user to observe the variation in the modal parameters with respect to the changes in structural parameters (such as d, Λ, d/Λ, and λ/>Λ). Besides their ease of use, these two schemes have high computational precision and adaptability, giving a novel platform to optical engineers to modulate the microstructured fibers according to their requirement.     

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

归一化水体指数（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阈值修正与水体遥感反演具有快速、水质适应性强、效果稳定的优势，对尤其是复杂条件下的水体信息遥感反演具有较好的提取效果。     

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

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

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.     

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.     

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.     

Bitumen-water interfacial tension modeling by using subtractive clustering method

Calculation of interfacial tension during bitumen production is a crucial issue in heavy crude oil history. Upon variation in pressure, temperature and phases composition, interfacial tension between bitumen and water change. In this work a sophisticated method called subtractive clustering was utilized to predict dynamic interfacial tension between bitumen and water. The subtractive clustering method is composed of optimized fuzzy logic algorithm. A data bank which is collected from open-source literature, is used to create a reliable model. Then the prediction accuracy of the measured dynamic interfacial tension using subtractive clustering have been examined. Results state that the comparison of measured interfacial tension and predicted interfacial tension indicate acceptable accuracy of proposed model. Also more than 90 percent of data points have less than 3 percent absolute error.