期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
A Generalization of Steinhaus' Chessboard Problem 被引量:1
1
作者 郝荣霞 刘彦佩 《Northeastern Mathematical Journal》 CSCD 2004年第2期139-144,共6页
In the present paper, a generalization of Steinhaus' chessboard problem of 8 × 8 and that of m×n are given and its solution is proved. Then, Steinhaus' chessboard problem is directly solved as a coro... In the present paper, a generalization of Steinhaus' chessboard problem of 8 × 8 and that of m×n are given and its solution is proved. Then, Steinhaus' chessboard problem is directly solved as a corollary, and the m>n case is solved immediately. 展开更多
关键词 GRAPH cut-set PATH
下载PDF
Edge-Tenacity in Graphs 被引量:1
2
作者 王志平 任光 赵连昌 《Journal of Mathematical Research and Exposition》 CSCD 北大核心 2004年第3期405-410,共6页
The edge-tenacity of a graph G(V,E) is denned as min{(|S|+T(G-S))/ω(G-S):S(?)E(G)},where T(G ?S) and ω(G-S), respectively, denote the order of the largest component and the number of the components of G-S. This is a... The edge-tenacity of a graph G(V,E) is denned as min{(|S|+T(G-S))/ω(G-S):S(?)E(G)},where T(G ?S) and ω(G-S), respectively, denote the order of the largest component and the number of the components of G-S. This is a better parameter to measure the stability of a network G, as it takes into account both the quantity and the order of components of the graph G-S. In a previous work, we established a necessary and sufficient condition for a graph to be edge-tenacious. These results are applied to prove that K-trees are strictly edge-tenacious. A number of results are given on the relation of edge-tenacity and other parameters, such as the higher-order edge toughness and the edge-toughness. 展开更多
关键词 edge cut-sets strictly edge-tenacious graph K-trees higher-order edge toughness edge toughness.
下载PDF
Research and Simulation of Mass Random Data Association Rules Based on Fuzzy Cluster Analysis
3
作者 Huaisheng Wu Qin Li and Xiumng Li 《国际计算机前沿大会会议论文集》 2021年第1期80-89,共10页
Because the traditional method is difficult to obtain the internal relationshipand association rules of data when dealingwith massive data, a fuzzy clusteringmethod is proposed to analyze massive data. Firstly, the sa... Because the traditional method is difficult to obtain the internal relationshipand association rules of data when dealingwith massive data, a fuzzy clusteringmethod is proposed to analyze massive data. Firstly, the sample matrix wasnormalized through the normalization of sample data. Secondly, a fuzzy equivalencematrix was constructed by using fuzzy clustering method based on thenormalization matrix, and then the fuzzy equivalence matrix was applied as thebasis for dynamic clustering. Finally, a series of classifications were carried out onthe mass data at the cut-set level successively and a dynamic cluster diagram wasgenerated. The experimental results show that using data fuzzy clustering methodcan effectively identify association rules of data sets by multiple iterations ofmassive data, and the clustering process has short running time and good robustness.Therefore, it can be widely applied to the identification and classification ofassociation rules of massive data such as sound, image and natural resources. 展开更多
关键词 Fuzzy clustering Massive random data Management rules cut-set levels
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部