[Objective]To study a diagnostic approach to diseases in pig＇s respiratory system based upon SVM binary tree. [Method] First with the help of clustering theory,the degree of separation based upon the characteristics ...[Objective]To study a diagnostic approach to diseases in pig＇s respiratory system based upon SVM binary tree. [Method] First with the help of clustering theory,the degree of separation based upon the characteristics of diseases is defined. Each time the type of highest degree of separation is isolated to get a decision tree with smaller accumulated errors and SVM binary tree is applied in the diagnostic experiment of four common respiratory diseases. [Result] The method is practicable and can be applied in the diagnosis of pig＇s respiratory diseases at the early stage. [Conclusion] It provides references to the healthy development of pig husbandry in China and increases in breeders＇ incomes.展开更多
基于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．展开更多
A radio frequency identification (RFID) reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm (BSBTA) with stack for RFID tag anti-collision to improve the per...A radio frequency identification (RFID) reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm (BSBTA) with stack for RFID tag anti-collision to improve the performance of binary tree algorithm (BTA). In BSBTA, the reader detects collisions by Manchester code and stores colliding prefixes in a stack. The query is composed of a two-bit prefix and an index value. Following every reader query, there are two timeslots for tags whose pointers and identities (IDs) match the query to respond, one for the tag whose next bit is 0 and the other for the tag with 1 as its next bit. Performance analysis and evaluation are also given. The time complexity and the communication complexity of BTA and BSBTA are derived. The simulation results compare the performance of BSBTA with several related anti-collision algorithms. It is shown that BSBTA outperforms BTA in terms of the average number of responded bits and timeslots for one tag identification.展开更多
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.展开更多
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.展开更多
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.展开更多
Existing temporal segmentation methods suffer from the problems of high computational complexity and complicated steps. To address this issue, we present a method that combines the binary tree and spatio-temporal tunn...Existing temporal segmentation methods suffer from the problems of high computational complexity and complicated steps. To address this issue, we present a method that combines the binary tree and spatio-temporal tunnel(STT) for temporal segmentation of rough videos. First, we compute initial cumulative spatio-temporal flow to determine flow overflow of sub-video which is divided from a rough video. Second, the decision tree is generated by combining binary tree and balance factor to dynamically adjust the sampling line of the STT. Finally, pixels on the sampling line are extracted to generate an adaptive STT for temporal proposals. Experimental results show that the computational complexity of the proposed method is significantly better than that of the comparison methods while ensuring accuracy.展开更多
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 modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-...The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-trees and e-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows and the execution time measurements confirm that for these O（2D） algorithms, the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.展开更多
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.展开更多
A binary complete decision table with many-valued decisions is a table with n attributes and 2^(n) pairwise distinct rows filled with numbers from the set{0,1}.Each row of this table is labeled with a nonempty finite ...A binary complete decision table with many-valued decisions is a table with n attributes and 2^(n) pairwise distinct rows filled with numbers from the set{0,1}.Each row of this table is labeled with a nonempty finite set of decisions.For a given row of the table,the task is to find a decision from the set of decisions attached to the row.Such tables are generalizations of Boolean functions.They can also be viewed as representations of various problems related to systems of decision rules.In this paper,we consider three types of classes of binary complete decision tables with many-valued decisions,closed with respect to removal of columns and changing of decisions.For tables from these classes,we study the relationships between the minimum weighted depth of deterministic,nondeterministic,and(for one type of classes)strongly nondeterministic decision trees and the total weight of attributes attached to columns.Note that nondeterministic decision trees and strongly nondeterministic decision trees for decision tables can be interpreted as a way of representing the two types of systems of decision rules for these tables.展开更多
在被动式射频识别(Radio frequency identification,RFID)系统中,即使有多个标签同时向阅读器发送信息,捕获效应也能使其中一个标签被阅读器成功识别.而且,捕获效应还会导致标签漏读.为防止标签漏读和进一步提高捕获效应下的识别效率,...在被动式射频识别(Radio frequency identification,RFID)系统中,即使有多个标签同时向阅读器发送信息,捕获效应也能使其中一个标签被阅读器成功识别.而且,捕获效应还会导致标签漏读.为防止标签漏读和进一步提高捕获效应下的识别效率,我们提出一种新的防冲突协议,该协议采用自适应和分配技术来减少标签间冲突.其优点在于,可合理地分配冲突标签和隐藏标签,从而提高识别效率.计算机仿真结果显示,在捕获效应发生的环境下,本文协议的识别效率优于现存协议.展开更多
基金Supported by Chongqing Key Applied and Basic Research Programs~~
文摘[Objective]To study a diagnostic approach to diseases in pig＇s respiratory system based upon SVM binary tree. [Method] First with the help of clustering theory,the degree of separation based upon the characteristics of diseases is defined. Each time the type of highest degree of separation is isolated to get a decision tree with smaller accumulated errors and SVM binary tree is applied in the diagnostic experiment of four common respiratory diseases. [Result] The method is practicable and can be applied in the diagnosis of pig＇s respiratory diseases at the early stage. [Conclusion] It provides references to the healthy development of pig husbandry in China and increases in breeders＇ incomes.
文摘基于Petersen图，提出了Binary Tree Petersen的网络结构，并对其特性进行了研究，证明了Binary Tree Petersen网络具有正则性以及良好的可扩展性，同时还具有比RP（k）、2-DToms更短的直径和良好的并行能力．另外，还基于Binary Tree Petersen网络分别给出了其上的单播和广播路由算法，证明了通信效率都为2j＋4．
基金the National Natural Science Foundation of China (No. 61071078)
文摘A radio frequency identification (RFID) reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm (BSBTA) with stack for RFID tag anti-collision to improve the performance of binary tree algorithm (BTA). In BSBTA, the reader detects collisions by Manchester code and stores colliding prefixes in a stack. The query is composed of a two-bit prefix and an index value. Following every reader query, there are two timeslots for tags whose pointers and identities (IDs) match the query to respond, one for the tag whose next bit is 0 and the other for the tag with 1 as its next bit. Performance analysis and evaluation are also given. The time complexity and the communication complexity of BTA and BSBTA are derived. The simulation results compare the performance of BSBTA with several related anti-collision algorithms. It is shown that BSBTA outperforms BTA in terms of the average number of responded bits and timeslots for one tag identification.
基金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.
基金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.
文摘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.
基金supported by the National Natural Science Foundation of China(Nos.61702347 and 62027801)the Natural Science Foundation of Hebei Province(Nos.F2022210007 and F2017210161)+1 种基金the Science and Technology Project of Hebei Education Department(Nos.ZD2022100 and QN2017132)the Central Guidance on Local Science and Technology Development Fund(No.226Z0501G)。
文摘Existing temporal segmentation methods suffer from the problems of high computational complexity and complicated steps. To address this issue, we present a method that combines the binary tree and spatio-temporal tunnel(STT) for temporal segmentation of rough videos. First, we compute initial cumulative spatio-temporal flow to determine flow overflow of sub-video which is divided from a rough video. Second, the decision tree is generated by combining binary tree and balance factor to dynamically adjust the sampling line of the STT. Finally, pixels on the sampling line are extracted to generate an adaptive STT for temporal proposals. Experimental results show that the computational complexity of the proposed method is significantly better than that of the comparison methods while ensuring accuracy.
文摘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 modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-trees and e-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows and the execution time measurements confirm that for these O（2D） algorithms, the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.
文摘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.
基金supported by King Abdullah University of Science and Technology(KAUST).
文摘A binary complete decision table with many-valued decisions is a table with n attributes and 2^(n) pairwise distinct rows filled with numbers from the set{0,1}.Each row of this table is labeled with a nonempty finite set of decisions.For a given row of the table,the task is to find a decision from the set of decisions attached to the row.Such tables are generalizations of Boolean functions.They can also be viewed as representations of various problems related to systems of decision rules.In this paper,we consider three types of classes of binary complete decision tables with many-valued decisions,closed with respect to removal of columns and changing of decisions.For tables from these classes,we study the relationships between the minimum weighted depth of deterministic,nondeterministic,and(for one type of classes)strongly nondeterministic decision trees and the total weight of attributes attached to columns.Note that nondeterministic decision trees and strongly nondeterministic decision trees for decision tables can be interpreted as a way of representing the two types of systems of decision rules for these tables.
文摘在被动式射频识别(Radio frequency identification,RFID)系统中,即使有多个标签同时向阅读器发送信息,捕获效应也能使其中一个标签被阅读器成功识别.而且,捕获效应还会导致标签漏读.为防止标签漏读和进一步提高捕获效应下的识别效率,我们提出一种新的防冲突协议,该协议采用自适应和分配技术来减少标签间冲突.其优点在于,可合理地分配冲突标签和隐藏标签,从而提高识别效率.计算机仿真结果显示,在捕获效应发生的环境下,本文协议的识别效率优于现存协议.
