基于扩散激活模型的无线自组网分簇方法

传统的分簇方法很少同时考虑安全因素及其对网络性能的影响。针对此问题,提出了一种基于信任关系的分簇方法,该分簇方法结合人类记忆的扩散激发模型思想,能够根据有限的局部信息自动地对整个网络进行分割。试验结果表明,该文所提出的分簇方法在精确度方面与集中式的分簇方法非常接近。因此,在提高Ad Hoc网络性能的同时,还可提高其安全性。     

聚类算法分析及在GIS中心选址中的仿真研究

通过对聚类算法初始点选择策略的分析和比较,经典k-means算法在GIS海量数据处理上的效率问题,提出了随机采样的k-means算法来进行坐标聚类;并将随机采样k-means算法应用于GIS中心选址,充分利用GIS数据分析和处理能力,以城市间的欧几里得距离为相似条件,采用最大最小原则选取初始点进行聚类,从而缓解局部最优解产生的概率;选取中心城市作为目标对象,从而提高商业决策的充分性和可靠性;经仿真结果验证了所提出的随机取样k-means算法的有效性和正确率。     

模糊聚类有效性的研究进展

聚类有效性评价对聚类分析具有重要意义,是聚类分析的瓶颈之一。本文从基于数据集模糊划分的方法和基于数据集几何结构的方法两方面,归纳综述了常用的模糊聚类有效性评价函数,并讨论了模糊聚类最佳类别数的自动确定问题。     

Study on Recognition Method of Similar Weather Scenes in Terminal Area

Weather is a key factor affecting the control of air traffic. Accurate recognition and classification of similar weather scenes in the terminal area is helpful for rapid decision-making in air traffic flow management. Current researches mostly use traditional machine learning methods to extract features of weather scenes, and clustering algorithms to divide similar scenes. Inspired by the excellent performance of deep learning in image recognition, this paper proposes a terminal area similar weather scene classification method based on improved deep convolution embedded clustering (IDCEC), which uses the combination of the encoding layer and the decoding layer to reduce the dimensionality of the weather image, retaining useful information to the greatest extent, and then uses the combination of the pre-trained encoding layer and the clustering layer to train the clustering model of the similar scenes in the terminal area. Finally, terminal area of Guangzhou Airport is selected as the research object, the method proposed in this article is used to classify historical weather data in similar scenes, and the performance is compared with other state-of-the-art methods. The experimental results show that the proposed IDCEC method can identify similar scenes more accurately based on the spatial distribution characteristics and severity of weather; at the same time, compared with the actual flight volume in the Guangzhou terminal area, IDCEC's recognition results of similar weather scenes are consistent with the recognition of experts in the field.     

Improvisation of Node Mobility Using Cluster Routing-based Group Adaptive in MANET

In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications.     

Parallelization of a dynamic SVD clustering algorithm and its application in information retrieval

We describe an implementation of a parallel document clustering scheme based on latent semantic indexing, which uses singular value decomposition. Given a set of documents, the clustering algorithm is dynamic in the sense that it automatically infers the number of clusters to be output. The parallel version has been implemented on a LAN and on a dual‐core system. Experimental evaluation of the algorithm shows an average speed‐up of 6.22 for the LAN implementation and an average speed‐up of 3.71 for the dual‐core implementation, while still maintaining a precision and recall in the range [0.85, 1]. To put these implementations in the context of information retrieval, we use the parallel clustering algorithm and develop a document similarity search system. The similarity search system shows good performance in terms of precision and recall. Copyright © 2010 John Wiley & Sons, Ltd.     

HDR Image Generation based on Intensity Clustering and Local Feature Analysis

This paper describes a cluster-based method for combining differently exposed images in order to increase their dynamic range. Initially an image is decomposed into a set of arbitrary shaped regions. For each region we compute a utility function which is based on the amount of presented information and an entropy. This function is used to select the most appropriate exposure for each region. After the exposures are selected, a bilateral filtering is applied in order to make the interregional transitions smooth. As a result we obtain weighting coefficients for each exposure and pixel. An output image is combined from clusters of input images using weights. Each pixel of the output image is calculated as a weighted sum of exposures. The proposed method allows recovering details from overexposed and underexposed parts of image without producing additional noise. Our experiments show effectiveness of the algorithm for the high dynamic range scenes. It requires no information about shutter speed or camera parameters. This method shows robust results even if the exposure difference between input images is 2-stops or higher.     

概念空间中上下位关系的意义识别研究

针对上下位关系在分类层级结构建立阶段遇到的多义性问题,给出一种概念空间中上下位关系意义识别的方法.单个概念的意义识别问题被转换为概念空间中上下位关系的意义识别.首先利用并列语境解决语境稀疏问题,获取上下位关系意义的语境.然后利用<同义词词林>对每个语境进行词义修正,以三种特征计算特征词权重,构建"关系一词'的高维向量空间,然后通过潜在语义分析降维,获取上下位关系意义的潜在语义,最后组平均聚类后得到关系的意义划分.在实验中,给出了聚类阈值自动调整函数,分析了词林和潜在语义分析的作用,实验结果证实了方法的有效性.     

基于网络距离度量和分簇的P2P流量控制

针对BitTorrent(BT)系统中对等连接消耗大量骨干网络带宽导致网络拥塞的问题,提出基于网络距离度量和网络分簇的节点分配策略。仿真实验表明,在不影响BT客户端下载性能的情况下,该分配策略能够将更多的数据流量限制在网络簇内部,提高数据流量的局部性,有效地减少BT系统对骨干网络带宽的消耗。     

基于VQ和LBG的移动AdHoc网络中分簇算法

应用信息论与数据压缩中的矢量量化理论和LBG算法,在簇和Voronoi胞腔、簇首和码矢、节点和矢量之间建立起——对应的关系,把分簇的过程转换成二维矢量量化中胞腔的分裂过程。设计一个以簇结构稳定性高和负载均衡度好为目标的移动自组网分簇算法,仿真结果显示,分簇算法能够迅速地进行分簇,并且簇的结构具有较高的稳定性。