A Diagnostic Approach to Diseases in Pig's Respiratory System Based upon SVM Binary Tree

[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.

Binary Tree Petersen网络性质及算法研究

基于Petersen图，提出了Binary Tree Petersen的网络结构，并对其特性进行了研究，证明了Binary Tree Petersen网络具有正则性以及良好的可扩展性，同时还具有比RP（k）、2-DToms更短的直径和良好的并行能力．另外，还基于Binary Tree Petersen网络分别给出了其上的单播和广播路由算法，证明了通信效率都为2j＋4．

An Assessment of Snow Cover Duration Variability Among Three Basins of Songhua River in Northeast China Using Binary Decision Tree

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.

THE NEW METHOD OF GENERATION OF BINARY TREES FROM ZER0(0) AND ONE(1) CODES

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.

A Novel Binary Firefly Algorithm for the Minimum Labeling Spanning Tree Problem

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’s Recursion Traversal Algorithm and Its 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.

Recursive and Nonrecursive Traversal Algorithms for Dynamically Created Binary Trees

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.

Design and implementation of binary tree data structure based on DNA computing

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.

BTreeU-Topk:基于二叉树的不确定数据上的Top-k查询算法

应用需求的发展衍生各种查询类型,Top-k查询是交互环境下一种重要查询类型.由于数据的不确定性,传统数据上的Top-k查询技术和方法不能直接应用于不确定数据查询.在已有不确定数据上Top-k查询算法的基础上,提出基于二叉树的不确定数据上Top-k查询算法BTreeU-Topk;为了提高算法执行效率,对二叉树进行修剪操作进而提出BTreeOPTU-Topk和BTreePU-Topk算法.实验结果表明,BTreeU-Topk,BTreeOPTU-Topk以及BTreePU-Topk算法在不同数据分布以及k值增长时均优于现有算法.

应用于PLC开发的梯形图向语句表转换的新方法

为了设计一种PLC控制器,文中重点研究了PLC编程系统中由梯形图到语句表编译解算的实现过程,并提出一种应用于PLC开发的梯形图转换为语句表的新方法,即基于节点势能的转换方法。该方法将梯形图类比电路图,仿照电势能,以节点势能表示虚拟梯形图中的能量流动,通过对梯形图节点势能的确定,将梯形图各图元之间的连接关系抽象为数值关系,并以此关系建立二叉树,遍历生成语句表。该方法简单清晰,以一种复杂度较低的数据结构将梯形图完整地描述出来,能够准确快速地完成由梯形图到语句表的编译解算,并可适用于逻辑关系比较复杂的梯形图程序的转换。该转换方法也能够为其他类似图形关系的解算提供参考,具有普遍适用性。

Reliability Analysis of Electrical System of CNC Machine Tool Based on Dynamic Fault Tree Analysis Method

The electrical system of CNC machine tool is very complex which involves many uncertain factors and dynamic stochastic characteristics when failure occurs.Therefore,the traditional system reliability analysis method,fault tree analysis(FTA)method,based on static logic and static failure mechanism is no longer applicable for dynamic systems reliability analysis.Dynamic fault tree(DFT)analysis method can solve this problem effectively.In this method,DFT first should be pretreated to get a simplified fault tree(FT);then the FT was modularized to get the independent static subtrees and dynamic subtrees.Binary decision diagram(BDD)analysis method was used to analyze static subtrees,while an approximation algorithm was used to deal with dynamic subtrees.When the scale of each subtree is smaller than the system scale,the analysis efficiency can be improved significantly.At last,the usefulness of this DFT analysis method was proved by applying it to analyzing the reliability of electrical system.

Blocking optimized SIMD tree search on modern processors

Tree search is a widely used fundamental algorithm. Modern processors provide tremendous computing power by integrating multiple cores, each with a vector processing unit. This paper reviews some studies on exploiting single instruction multiple date （SIMD） capacity of processors to improve the performance of tree search, and proposes several improvement methods on reported SIMD tree search algorithms. Based on blocking tree structure, blocking for memory alignment and dynamic blocking prefetch are proposed to optimize the overhead of memory access. Furthermore, as a way of non-linear loop unrolling, the search branch unwinding shows that the number of branches can exceed the data width of SIMD instructions in the SIMD search algorithm. The experiments suggest that blocking optimized SIMD tree search algorithm can achieve 1.6 times response speed faster than the un-optimized algorithm.

<i>T</i>₃Tree and Its Traits in Understanding Integers

Valuated binary tree is emerging its magical characteristics in study of integers. As the father tree of all valuated binary subtrees, T3 tree plays a very important role in studying the odd integers for its owning both the common properties of a general valuated binary tree and its own traits of covering all the odd integers bigger than 1. The article investigates the properties of the T3 tree as well as the multiplications on the tree. It exhibits the distribution of a node's multiples, the distribution of the product of two nodes and the distribution of the square of a node. Some other contents such as fundamental properties of the T3 tree and path connecting a product to its divisor-nodes are also investigated with detail mathematical proofs. The theorems and corollaries proved in the article lay a foundation for future work.

二叉树CreateBTree算法的改进

在分析二叉树的 Create BTree算法的基础上 ,利用线性探测再散列方法对 Create B-Tree算法的中序遍历序列进行预处理来改进 Create BTree算法 ,使得改进后的 Create BTree算法在最差情况下 ,时间复杂度由 O(N 2 )降为 O(N )。

Prefix Subsection Matching Binary Algorithm in Passive RFID System

Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,but its shortcoming is high searching delay and high tag average response times.A prefix subsection matching binary(PSMB) algorithm based on QTalgorithm is proposed.The key idea of PSMB anti-collision algorithm is that,during searching phase,a given reader uses the particular tags ID,which has been searched out formerly,to shorten searching delay and depress tag average response times.The idea of PSMB algorithm can be described as follows.Usually,tag ID is composed of several subsections which have different meanings.Based on the tags ID searched out formerly,a given reader builds a prefix database.In subsequent searching phase,the reader uses its prefix database to deduce searching space of tag ID.Simulation results show that identification delay of PSMB algorithm is about 1/3 of QTalgorithm,tag average response times is about 1/4 of QTalgorithm,and system throughput rate is treble QTalgorithm.

Fault Tree Analysis of CNC Machine Tool Based on BDD Technology

CNC machine tool is a large complex system which contains both mechanical and electrical components.As one of these components,the spindle is crucial for the performance of CNC machine tool.To improve the quality of CNC machine,the reliability of spindle was evaluated in this paper using a fault tree analysis(FTA)method.The FTA method is a set of calculation methods based on Boolean algebra.However,it is difficult to analyze a large and complex fault tree with inaccurate results and low efficiency as well as the complexity of time and space.Both of them will result in the so-called "combinatorial explosion".To overcome this problem,the analysis method based on binary decision diagram(BDD)was introduced in our works,and a sorting method about bottom events was also recommended which can reduce the size of the BDD effectively.

An Improved Treed Gaussian Process

Many black box functions and datasets have regions of different variability. Models such as the Gaussian process may fall short in giving the best representation of these complex functions. One successful approach for modeling this type of nonstationarity is the Treed Gaussian process [1], which extended the Gaussian process by dividing the input space into different regions using a binary tree algorithm. Each region became its own Gaussian process. This iterative inference process formed many different trees and thus, many different Gaussian processes. In the end these were combined to get a posterior predictive distribution at each point. The idea was that when the iterations were combined, smoothing would take place for the surface of the predicted points near tree boundaries. We introduce the Improved Treed Gaussian process, which divides the input space into a single main binary tree where the different tree regions have different variability. The parameters for the Gaussian process for each tree region are then determined. These parameters are then smoothed at the region boundaries. This smoothing leads to a set of parameters for each point in the input space that specify the covariance matrix used to predict the point. The advantage is that the prediction and actual errors are estimated better since the standard deviation and range parameters of each point are related to the variation of the region it is in. Further, smoothing between regions is better since each point prediction uses its parameters over the whole input space. Examples are given in this paper which show these advantages for lower-dimensional problems.

Brief Investigation on Square Root of a Node of <i>T</i>₃Tree

The article investigates some properties of square root of T3 tree’s nodes. It first proves several inequalities that are helpful to estimate the square root of a node, and then proves several theorems to describe the distribution of the square root of the nodes on T3 tree.

Some Inequalities on <i>T₃</i>Tree

The article proves several inequalities derived from nodal multiplication on T3 tree. The proved inequalities are helpful to estimate certain quantities related with the T3 tree as well as examples of proving an inequality embedded with the floor functions.