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.

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

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

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.

The Design of the Minimum Spanning Tree Algorithms

Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of minimum spanning trees. It designs the corresponding fitness function,operator and few controlling strategies to improve its speed and evolutionary efficiency.Only one solution can be gotten with running traditional al-gorithem atone time.The new algorithm can get a set of the solutions with higher probability in a shorter time.The experiment shows that it has a better performance than traditional methods.

A Gene-Pool Based Genetic Algorithm for TSP

Based on the analysis of previous genetic algorithms (GAs) for TSP, a novel method called Ge- GA is proposed. It combines gene pool and GA so as to direct the evolution of the whole population. The core of Ge- GA is the construction of gene pool and how to apply it to GA. Different from standard GAs, Ge- GA aims to enhance the ability of exploration and exploitation by incorporating global search with local search. On one hand a local search called Ge- Lo-calSearch operator is proposed to improve the solution quality, on the other hand the modified Inver-Over operator called Ge InverOver is considered as a global search mechanism to expand solution space of local minimal. Both of these operators are based on the gene pool. Our algorithm is applied to 11 well-known traveling salesman problems whose numbers of cities are from 70 to 1577 cities. The experiments results indicate that Ge- GA has great robustness for TSP. For each test instance, the average value of solution quality, found in accepted time, stays within 0. 001% from the optimum.

GA-iForest: An Efficient Isolated Forest Framework Based on Genetic Algorithm for Numerical Data Outlier Detection

With the development of data age,data quality has become one of the problems that people pay much attention to.As a field of data mining,outlier detection is related to the quality of data.The isolated forest algorithm is one of the more prominent numerical data outlier detection algorithms in recent years.In the process of constructing the isolation tree by the isolated forest algorithm,as the isolation tree is continuously generated,the difference of isolation trees will gradually decrease or even no difference,which will result in the waste of memory and reduced efficiency of outlier detection.And in the constructed isolation trees,some isolation trees cannot detect outlier.In this paper,an improved iForest-based method GA-iForest is proposed.This method optimizes the isolated forest by selecting some better isolation trees according to the detection accuracy and the difference of isolation trees,thereby reducing some duplicate,similar and poor detection isolation trees and improving the accuracy and stability of outlier detection.In the experiment,Ubuntu system and Spark platform are used to build the experiment environment.The outlier datasets provided by ODDS are used as test.According to indicators such as the accuracy,recall rate,ROC curves,AUC and execution time,the performance of the proposed method is evaluated.Experimental results show that the proposed method can not only improve the accuracy and stability of outlier detection,but also reduce the number of isolation trees by 20%-40%compared with the original iForest method.

Using genetic/simulated annealing algorithm to solve disassembly sequence planning

Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.

Rotation forest based on multimodal genetic algorithm

In machine learning,randomness is a crucial factor in the success of ensemble learning,and it can be injected into tree-based ensembles by rotating the feature space.However,it is a common practice to rotate the feature space randomly.Thus,a large number of trees are required to ensure the performance of the ensemble model.This random rotation method is theoretically feasible,but it requires massive computing resources,potentially restricting its applications.A multimodal genetic algorithm based rotation forest(MGARF)algorithm is proposed in this paper to solve this problem.It is a tree-based ensemble learning algorithm for classification,taking advantage of the characteristic of trees to inject randomness by feature rotation.However,this algorithm attempts to select a subset of more diverse and accurate base learners using the multimodal optimization method.The classification accuracy of the proposed MGARF algorithm was evaluated by comparing it with the original random forest and random rotation ensemble methods on 23 UCI classification datasets.Experimental results show that the MGARF method outperforms the other methods,and the number of base learners in MGARF models is much fewer.

Multicast Routing Based on Hybrid Genetic Algorithm

A new multicast routing algorithm based on the hybrid genetic algorithm (HGA) is proposed. The coding pattern based on the number of routing paths is used. A fitness function that is computed easily and makes algorithm quickly convergent is proposed. A new approach that defines the HGA's parameters is provided. The simulation shows that the approach can increase largely the convergent ratio, and the fitting values of the parameters of this algorithm are different from that of the original algorithms. The optimal mutation probability of HGA equals 0.50 in HGA in the experiment, but that equals 0.07 in SGA. It has been concluded that the population size has a significant influence on the HGA's convergent ratio when it's mutation probability is bigger. The algorithm with a small population size has a high average convergent rate. The population size has little influence on HGA with the lower mutation probability.

基于FP-Tree 算法的仓库货位优化研究

货位优化是降低系统成本提高客户满意度的有效途径之一。本文首先运用FP-Tree算法获取频繁项集,并构建了以提高货架稳定性、减少订单拣选距离为目标的货位优化模型,再利用理想点法,建立了按照权重综合的多目标优化评价函数,最后利用遗传算法进行仿真求解。结果表明FP-Tree算法通过挖掘相关货物关联规则减少订单拣选距离从而实现货位优化,是降低仓库管理成本、提高仓库管理效率与效益的有效方法与途径。

A Physical Layer Network Coding Based Tag Anti-Collision Algorithm for RFID System

In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.

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.

SOLVING MINIMUM SPANNING TREE PROBLEM WITH DNA COMPUTING

Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed.

二叉树CreateBTree算法的改进

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

基于改进SVM算法的电力工程异常数据检测方法设计

针对传统电力工程数据异常检测过程中存在准确度差且主观性较强的问题,文中提出了一种基于改进支持向量机的电力工程数据异常检测模型。其在传统支持向量机的基础上加入了二叉树多分类算法,从而使模型具备多特征分类能力。同时通过引入AdaBoost分类器,来改善支持向量机弱特征分类能力较差的不足。为进一步提高准确度,还使用鲸鱼算法对模型惩罚项、核函数及迭代次数进行优化。在实验测试中,所提算法的检测准确度相较其他三种对比算法分别提升了5.35%、2.17%和5.35%,说明该算法具备更为理想的性能,并可有效提升电力工程数据检测的准确度,故能为电力基建工程验收与管理提供数据支撑。

基于最优样本和最优属性组合的作业车间调度规则挖掘

作业车间调度问题可使用调度规则解决。为挖掘到高效、准确的调度规则,基于训练样本最优和属性组合最优的核心思想,提出一种基于最优样本与最优属性组合的决策树-遗传算法框架(NDTGA)。该框架在构造训练数据时采用成对比较的方式,在构造属性组合时使用属性原值、差值、对比值等多种组合;在遗传算法的每次寻优过程中,调用决策树挖掘全新的调度规则;最终得到最优训练样本和最优属性组合,进而得到最优的调度规则。通过与经典调度规则和其他机器学习算法的对比实验论证了NDTGA框架挖掘所得调度规则的优越性。

具有串并行异类工序约束的多柔性车间联合调度

为了减少具有串并行异类工序约束多车间联合调度的总延期时间,提出了基于知识牵引遗传算法的调度求解方法。首先,采用扩展工艺树描述串并行异类工序约束,并基于无向图描述机器在多车间的分布;针对染色体初始化和进化过程中的扩展工艺树约束,定义了紧前工序数和剩余紧前工序数的概念,基于剩余紧前工序数设计了染色体初始化和进化方法;为了提高遗传算法的进化能力,将种群进化能力和最优个体进化能力作为知识,用于牵引算法的进化方式和方向,从而提出了知识牵引遗传算法的求解方法。经实验验证,知识牵引遗传算法调度的总延期时间均值最小,为30.8 h,说明该算法在多车间调度中具有最好的优化性能;且总延期时间盒须图长度最小,说明知识牵引遗传算法的稳定性也较好。

基于机器学习耦合模型预测FDM零件的表面粗糙度

熔融沉积工艺(FDM)制造的零件表面粗糙度高,不仅影响了零件外观,还降低了性能。采用响应面实验设计,研究了层高(A)、填充密度(B)、喷嘴温度(C)、床层温度(D)和打印速度(E)对聚乳酸(PLA)零件表面粗糙度的影响。同时,将遗传算法(GA)与决策树(DT)、人工神经元网络(ANN)两种机器学习模型相结合,预测了零件的表面粗糙度。结果表明,A、B、C和E是显著影响零件表面粗糙度的主效应,A×B、A×C、A×E、B×C、B×E、C×E是影响显著的交互效应。GA+DT耦合模型预测PLA零件表面粗糙度的准确性更高,预测值与实验值的相关系数(R2)、均方误差(MSE)和平均绝对误差(MAE)分别为0.952、0.132和0.234,优于GA+ANN的0.823、1.561和1.759。GA+DT模型的预测值与实验值的Pearson相关系数为0.984,而GA+ANN模型仅为0.903,这表明GA+DT模型在预测PLA零件表面粗糙度时准确度更高。