基于Petersen图，提出了Binary Tree Petersen的网络结构，并对其特性进行了研究，证明了Binary Tree Petersen网络具有正则性以及良好的可扩展性，同时还具有比RP（k）、2-DToms更短的直径和良好的并行能力．另外，还基于Binary Tree P...基于Petersen图，提出了Binary Tree Petersen的网络结构，并对其特性进行了研究，证明了Binary Tree Petersen网络具有正则性以及良好的可扩展性，同时还具有比RP（k）、2-DToms更短的直径和良好的并行能力．另外，还基于Binary Tree Petersen网络分别给出了其上的单播和广播路由算法，证明了通信效率都为2j＋4．展开更多
The dynamics of snow cover differs greatly from basin to basin in the Songhua River of Northeast China, which is attributable to the differences in the topographic shift as well as changes in the vegetation and climat...The dynamics of snow cover differs greatly from basin to basin in the Songhua River of Northeast China, which is attributable to the differences in the topographic shift as well as changes in the vegetation and climate since the hydrological year(HY) 2003. Daily and flexible multi-day combinations from the HY 2003 to 2014 were produced using Moderate Resolution Imaging Spectroradiometer(MODIS) from Terra and Aqua remote sensing satellites for the snow cover products in the three basins including the Nenjiang River Basin(NJ), Downstream Songhua River Basin(SD) and Upstream Songhua River Basin(SU). Snow cover duration(SCD) was derived from flexible multiday combination each year. The results showed that SCD was significantly associated with elevation, and higher SCD values were found out in the mountainous areas. Further, the average SCDs of NJ, SU and SD basins were 69.43, 98.14 and 88.84 d with an annual growth of 1.36, 2.04 and 2.71 d, respectively. Binary decision tree was used to analyze the nonlinear relationships between SCD and six impact factors, which were successfully applied to simulate the spatial distribution of depth and water equivalent of snow. The impact factors included three topographic factors(elevation, aspect and slope), two climatic factors(precipitation and air temperature) and one vegetation index(Normalized Difference Vegetation Index, NDVI). By treating yearly SCD values as dependent variables and six climatic factors as independent variables, six binary decision trees were built through the combination classification and regression tree(CART) with and without the consideration of climate effect. The results from the model show that elevation, precipitation and air temperature are the three most influential factors, among which air temperature is the most important and ranks first in two of the three studied basins. It is suggested that SCD in the mountainous areas might be more sensitive to climate warming, since precipitation and air temperature are the major factors controlling the persistence of snow cover in the mountainous areas.展开更多
A binary tree can be represented by a code reflecting the traversal of the corresponding regular binary tree in given monotonic order. A different coding scheme based on the branches of a regular binary tree with n-no...A binary tree can be represented by a code reflecting the traversal of the corresponding regular binary tree in given monotonic order. A different coding scheme based on the branches of a regular binary tree with n-nodes is proposed. It differs from the coding scheme generally used and makes no distinction between internal nodes and terminal nodes. A code of a regular binary tree with nnodes is formed by labeling the left branches by O’s and the right branches by l’s and then traversing these branches in pre-order. Root is always assumed to be on a left branch.展开更多
Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatoria...Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatorial optimization problem,which is widely applied in communication networks,multimodal transportation networks,and data compression.Some approximation algorithms and heuristics algorithms have been proposed for the problem.Firefly algorithm is a new meta-heuristic algorithm.Because of its simplicity and easy implementation,it has been successfully applied in various fields.However,the basic firefly algorithm is not suitable for discrete problems.To this end,a novel discrete firefly algorithm for the MLST problem is proposed in this paper.A binary operation method to update firefly positions and a local feasible handling method are introduced,which correct unfeasible solutions,eliminate redundant labels,and make the algorithm more suitable for discrete problems.Computational results show that the algorithm has good performance.The algorithm can be extended to solve other discrete optimization problems.展开更多
Binary tree is a very important data structure in computer science. Some major properties are discussed. Both recursive and non-recursive traversal methods of binary tree are discussed in detail. Some improvement...Binary tree is a very important data structure in computer science. Some major properties are discussed. Both recursive and non-recursive traversal methods of binary tree are discussed in detail. Some improvements in programming are proposed.展开更多
The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings f...The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings for storage and all elements of the binary tree were completely given out. Then, the implementations of all bio-operations in DNA computer were described. Finally, to prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings was introduced. The process of an algorithm implemented on this binary tree was demonstrated. Based on this method, more other data structures in DNA computer can be developed.展开更多
文摘基于Petersen图，提出了Binary Tree Petersen的网络结构，并对其特性进行了研究，证明了Binary Tree Petersen网络具有正则性以及良好的可扩展性，同时还具有比RP（k）、2-DToms更短的直径和良好的并行能力．另外，还基于Binary Tree Petersen网络分别给出了其上的单播和广播路由算法，证明了通信效率都为2j＋4．
基金Under the auspices of National Natural Science Foundation of China(No.41471291,41801283,41070104)Startup Foundation for Doctors of Jilin Jianzhu University(No.861111)13th Five-Year Plan of Technical and Social Research Project for Jilin Colleges(No.JJKH20170257KJ)
文摘The dynamics of snow cover differs greatly from basin to basin in the Songhua River of Northeast China, which is attributable to the differences in the topographic shift as well as changes in the vegetation and climate since the hydrological year(HY) 2003. Daily and flexible multi-day combinations from the HY 2003 to 2014 were produced using Moderate Resolution Imaging Spectroradiometer(MODIS) from Terra and Aqua remote sensing satellites for the snow cover products in the three basins including the Nenjiang River Basin(NJ), Downstream Songhua River Basin(SD) and Upstream Songhua River Basin(SU). Snow cover duration(SCD) was derived from flexible multiday combination each year. The results showed that SCD was significantly associated with elevation, and higher SCD values were found out in the mountainous areas. Further, the average SCDs of NJ, SU and SD basins were 69.43, 98.14 and 88.84 d with an annual growth of 1.36, 2.04 and 2.71 d, respectively. Binary decision tree was used to analyze the nonlinear relationships between SCD and six impact factors, which were successfully applied to simulate the spatial distribution of depth and water equivalent of snow. The impact factors included three topographic factors(elevation, aspect and slope), two climatic factors(precipitation and air temperature) and one vegetation index(Normalized Difference Vegetation Index, NDVI). By treating yearly SCD values as dependent variables and six climatic factors as independent variables, six binary decision trees were built through the combination classification and regression tree(CART) with and without the consideration of climate effect. The results from the model show that elevation, precipitation and air temperature are the three most influential factors, among which air temperature is the most important and ranks first in two of the three studied basins. It is suggested that SCD in the mountainous areas might be more sensitive to climate warming, since precipitation and air temperature are the major factors controlling the persistence of snow cover in the mountainous areas.
文摘A binary tree can be represented by a code reflecting the traversal of the corresponding regular binary tree in given monotonic order. A different coding scheme based on the branches of a regular binary tree with n-nodes is proposed. It differs from the coding scheme generally used and makes no distinction between internal nodes and terminal nodes. A code of a regular binary tree with nnodes is formed by labeling the left branches by O’s and the right branches by l’s and then traversing these branches in pre-order. Root is always assumed to be on a left branch.
基金This work is supported by the National Natural Science Foundation of China under Grant 61772179the Hunan Provincial Natural Science Foundation of China under Grant 2019JJ40005+3 种基金the Science and Technology Plan Project of Hunan Province under Grant 2016TP1020the Double First-Class University Project of Hunan Province under Grant Xiangjiaotong[2018]469the Open Fund Project of Hunan Provincial Key Laboratory of Intelligent Information Processing and Application for Hengyang Normal University under Grant IIPA19K02the Science Foundation of Hengyang Normal University under Grant 19QD13.
文摘Given a connected undirected graph G whose edges are labeled,the minimumlabeling spanning tree(MLST)problemis to find a spanning tree of G with the smallest number of different labels.TheMLST is anNP-hard combinatorial optimization problem,which is widely applied in communication networks,multimodal transportation networks,and data compression.Some approximation algorithms and heuristics algorithms have been proposed for the problem.Firefly algorithm is a new meta-heuristic algorithm.Because of its simplicity and easy implementation,it has been successfully applied in various fields.However,the basic firefly algorithm is not suitable for discrete problems.To this end,a novel discrete firefly algorithm for the MLST problem is proposed in this paper.A binary operation method to update firefly positions and a local feasible handling method are introduced,which correct unfeasible solutions,eliminate redundant labels,and make the algorithm more suitable for discrete problems.Computational results show that the algorithm has good performance.The algorithm can be extended to solve other discrete optimization problems.
文摘Binary tree is a very important data structure in computer science. Some major properties are discussed. Both recursive and non-recursive traversal methods of binary tree are discussed in detail. Some improvements in programming are proposed.
文摘The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings for storage and all elements of the binary tree were completely given out. Then, the implementations of all bio-operations in DNA computer were described. Finally, to prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings was introduced. The process of an algorithm implemented on this binary tree was demonstrated. Based on this method, more other data structures in DNA computer can be developed.
