CK-Modes Clustering Algorithm Based on Node Cohesion in Labeled Property Graph

The designation of the cluster number K and the initial centroids is essential for K-modes clustering algorithm. However, most of the improved methods based on K-modes specify the K value manually and generate the initial centroids randomly, which makes the clustering algorithm significantly dependent on human-based decisions and unstable on the iteration time. To overcome this limitation, we propose a cohesive K-modes (CK-modes) algorithm to generate the cluster number K and the initial centroids automatically. Explicitly, we construct a labeled property graph based on index-free adjacency to capture both global and local cohesion of the node in the sample of the input datasets. The cohesive node calculated based on the property similarity is exploited to split the graph to a K-node tree that determines the K value, and then the initial centroids are selected from the split subtrees. Since the property graph construction and the cohesion calculation are only performed once, they account for a small amount of execution time of the clustering operation with multiple iterations, but significantly accelerate the clustering convergence. Experimental validation in both real-world and synthetic datasets shows that the CK-modes algorithm outperforms the state-of-the-art algorithms.     

控制网最小独立闭合环的搜索算法

针对人工和一些商业软件搜索独立闭合环的不准确性及其低效性,本文借助图论知识,提出了一种有效而简便的算法,可以利用计算机自动搜索出所有的独立闭合环。即用无向连通图表示控制网,构建矩阵表示控制网观测边的关系,通过处理变换矩阵使计算机能快速准确搜索到最小独立闭合环;通过实例分析证明此种方法在GPS控制网的可行性,且理论上该方法也能较好地运用于平面网及水准网闭合差中闭合环的的搜索及解算问题,对工程测量中闭合差的求解有一定借鉴作用。     

有向连接图中节点可达的矩阵行取1算法

本文给出一种判断有向连接图中节点是否可达的算法，与一般相邻矩阵的布尔代数算法相比，具有简便快速的优点。     

基于k阶不可逆邻接矩阵的警车巡逻

针对警车巡弋中的状态转移,分析了状态转移子空间的容量,给出了k阶不可逆邻接矩阵的定义及其算法,并定义了警车动态巡逻过程的适应度函数。利用改进的适应度函数和排序交叉算子,提高了用于优化警车巡弋路线的遗传算法的收敛速度,得到了较好的仿真结果。     

基于IPoverTS系统网段内地址扩展技术的研究

针对IPoverTS系统研究同一网段内的地址扩展技术,分析常用的链路扩展方法,在无线链路传输中针对该方法所导致的信道有效占有率不稳定且不足提出邻接表法。为了增强邻接表法的地址扩展灵活性将邻接表法改进为自适应邻接表法。测试结果表明,自适应邻接表法解决了同一网段内的地址扩展问题．同时提高了无线信道有效数据的占有率和稳定性。     

Robustness and generality issues of feature recognition for CNC machining

The problems of multiple interpretations and feature interactions that occur in attributed adjacency (AA)-based feature extraction systems result from a lack of robustness in the recognition algorithm when deviations from the feature definitions occur. This stems from the fact that individual graphs are stored in the feature taxonomy and once multiple graphs interact the interaction issue occurs. In this paper, a new method is presented for defining features based on a type of hint-based taxonomy, which is rare in boundary representation schemes. This new method still uses the traditional AA graph and matrix to define the part but does not extract subgraphs. It is shown that identifying only one face and then proceeding can find a feature. The modified attributed adjacency (MAA) scheme is used to define the part which allows more information to be stored in the part representation (graph or matrix), and this allows multiple interpretations to be solved.     

关于优美图的某些结论

本文定义了大邻接矩阵、水平矩阵,给出了图为优美图的两个充分必要条件,并得到如下结论:K_m_i,n_i与K_(m(i+1)),n_(i+1)用路P_(t_i)(i=1,2,…,N)顺次串接为优美图,对任意的优美树T_n,T_n+K_m为优美图.     

工程图纸扫描图象的线段完整识别算法

给出一种基于单义域邻接图的完整识别线段算法。采用单义域邻接图来描述工程图纸扫描图象的几何属性与拓扑关系。通过分析单义域几何与拓扑特征定交点域。首先选取线段域作种子线段,以交点域为连接线索,选取共线且误差最小的线段域进行种子线段生长。从而实现线段完整识别,该算法有铲地解决了在线段与线段相交及线段与圆弧（圆）相交和相切情况下如何保证图元描述完整性问题,大大提高了整体矢量化水平。     

基于邻接矩阵的配电网耦合点区域的分离

变结构耗散网络是一种新的配电网自动化算法 ,能有效地实现配电网自动化的相关功能。由开关顶点负荷求弧负荷和耦合顶点负荷的点弧变换是整个算法的基础 ,而进行点弧变换的关键就在于处理耦合点 ,分离耦合点区域。该文提出了一种新的耦合点区域分离的算法。算法根据配电网拓扑结构形成的顶点邻接矩阵和构造的耦合点信息矩阵进行矩阵的相关布尔运算得到耦合点区域分离的判据矩阵 ,根据判据矩阵很容易从复杂的配电网中确定耦合点区域的个数并将耦合点区域分离     

逻辑函数的卡诺图化简法

从卡诺图化简法与公式化简法的比较入手,说明卡诺图化简法的优点及适用范围,阐述了卡诺图的特点、最小项的定义和性质、用卡诺图化简逻辑函数的基本原理以及化简是否达到最简形式的判定标准。然后给出了具体实例来诠释卡诺图化简法并给出其应用的一般步骤。最后总结出卡诺图化简法易出错的几种情况,从而得出用卡诺图化简逻辑函数的一般方法。