This study's objective is to assess the performance of the common prim and the Kruskal of the minimum spanning tree in building up super metric space. We proposed the use of complexity analysis and experimental me...
详细信息
ISBN:
(纸本)9780769538174
This study's objective is to assess the performance of the common prim and the Kruskal of the minimum spanning tree in building up super metric space. We proposed the use of complexity analysis and experimental methods to assess these two methods. After the analysis of the sample data of Shanghai and Shenzhen 300 index daily from the second half of 2005 to the second half of 2007, The results showed that when the number of shares is less than 100, judging from the space complexity, Kruskal algorithm is relatively superior to prim algorithm;however, when the number of shares is greater than 100, from the time complexity's aspect, prim algorithm is more superior. This study's conclusion indicates that matrix of Shanghai and Shenzhen 300 stock the inter-continental distance formed by the edge map more, so prim better than Kruskal.
Many routing topologies have been proposed to extend lifetime of Ubiquitous Sensor Network (USN) consisting of sensor nodes with limited energy. If measurement data is collected periodically for every nodes and perfec...
详细信息
ISBN:
(纸本)9788955191356
Many routing topologies have been proposed to extend lifetime of Ubiquitous Sensor Network (USN) consisting of sensor nodes with limited energy. If measurement data is collected periodically for every nodes and perfect fusion during data aggregation, Minimum Spanning Tree (MST) and chains have been two major topologies. MST minimizes total transmission energy and chain consumes energy very evenly throughout the nodes. Various publications such as LEACH, PEGASIS and PEDAP announced many good USN topologies, there still is little study about the topology itself especially in terms of energy consumption excluding USN system-related factors. This paper includes the following study. We proposed a new chain topology and solved Minimum Spanning Chain (MSC) by Linear Programming (LP). Then we calculated and analysed topology length and standard deviation/coefficient of variation of link lengths through simulation. As results of simulation analysis we confirmed that the proposed chain solution is very useful routing topology in USNs.
Support-graph preconditioners have been shown to be a valuable tool for the iterative solution, via a Preconditioned Conjugate Gradient method, of the KKT systems that must be solved at each iteration of an Interior P...
详细信息
Support-graph preconditioners have been shown to be a valuable tool for the iterative solution, via a Preconditioned Conjugate Gradient method, of the KKT systems that must be solved at each iteration of an Interior Point algorithm for the solution of Min Cost Flow problems. These preconditioners extract a proper triangulated subgraph, with "large" weight, of the original graph: in practice, trees and Brother-Connected Trees (BCTs) of depth two have been shown to be the most computationally efficient families of subgraphs. In the literature, approximate versions of the Kruskal algorithm for maximum-weight spanning trees have most often been used for choosing the subgraphs;prim-based approaches have been used for trees, but no comparison have ever been reported. We propose prim-based heuristics for BCTs, which require nontrivial modifications w.r.t. the previously proposed Kruskal-based approaches, and present a computational comparison of the different approaches, which shows that prim-based heuristics are most often preferable to Kruskal-based ones.
暂无评论