Papers by Keyword: Binary Tree

Paper TitlePage

Authors: Fang Song Cui, Guo Zhong Cheng, Da Zhi Pan
Abstract: The LZW is an effective and adaptive data compression algorithm, but during the encoding process, the entries in the dictionary would store characters that have been stored leading to waste memory resources, so this paper presents a improved algorithm for LZW compression algorithm. On the one hand, the content of the source file is transformed into 01 character string; on the other hand, adopting binary tree structure to store the entries of the dictionary. There are some simulation experiments for different sizes files, the results show that the improved LZW algorithm overcomes effectively the shortcoming in dictionary storage structure of the original algorithm.
768
Authors: Ya Feng Meng, Sai Zhu, Rong Li Han
Abstract: Neural network and Fault dictionary are two kinds of very useful fault diagnosis method. But for large scale and complex circuits, the fault dictionary is huge, and the speed of fault searching affects the efficiency of real-time diagnosing. When the fault samples are few, it is difficulty to train the neural network, and the trained neural network can not diagnose the entire faults. In this paper, a new fault diagnosis method based on combination of neural network and fault dictionary is introduced. The fault dictionary with large scale is divided into several son fault dictionary with smaller scale, and the search index of the son dictionary is organized with the neural networks trained with the son fault dictionary. The complexity of training neural network is reduced, and this method using the neural networks ability that could accurately describe the relation between input data and corresponding goal organizes the index in a multilayer binary tree with many neural networks. Through this index, the seeking scope is reduced greatly, the searching speed is raised, and the efficiency of real-time diagnosing is improved. At last, the validity of the method is proved by the experimental results.
2078
Authors: Wei Dong Zhong, Jun Jie Zhu, Li Xian Wei, Xiao Yuan Yang
Abstract: Illumination consistency makes one of important roles in image authenticity, especially in splicing and copy-move rendering. This paper proposes a new method to estimate illuminant direction based on idea of binary sort tree. The algorithm calculates the least error function to structure the binary tree of illuminant direction. And it doesn’t need to expand much time to solve pathosis equation and access accuracy is improved. The experiment shows that, the algorithm can effectively calculate the light source direction of different objects and backgrounds in an image especially in infinite light source, and the detection correct rate reaches 85.4% in general situation , what’s more, 88.1% in infinite light source. Anyway, the algorithm in this paper is a great advancement of blind forensics based on consistency in lighting direction.
5463
Authors: Yu Ping Qin, Peng Da Qin, Shu Xian Lun, Yi Wang
Abstract: A new SVM multi-class classification algorithm is proposed. Firstly, the optimal binary tree is constructed by the scale and the distribution area of every class sample, and then the sub-classifiers are trained for every non-leaf node in the binary tree. For the sample to be classified, the classification is done from the root node until someone leaf node, and the corresponding class of the leaf node is the class of the sample. The experimental results show that the algorithm improves the classification precision and classification speed, especially in the situation that the sample scale is less but its distribution area is bigger, the algorithm can improve greatly the classification performance.
2529
Authors: Run Ze Wan, Xing Yan Zhang
Abstract: The self-organizing nature of its architecture of wireless sensor networks (WSNs) introduce unique challenges for privacy preservation of data. This paper analyzes the cluster-based private data aggregation protocol (CPDA), and proposes a privacy protection protocol based on hierarchical cluster. We firstly reorganize nodes in cluster according to the logic structure of binary-tree in which each node transmits slice data instead of the full one. And then, we establish the hierarchical privacy tree to manage the group of keys, which purpose is privacy protection in case of data aggregation.
773
Authors: Tong Tong Zhu, Gang Xu, Ming Cong Ma, Xing Ye Liu
Abstract: An approach is presented based on scattered data points subdivision surfaces to achieve multi-resolution surface reconstruction techniques. In the surface reconstruction process, based on gray-scale image edge detection ideological eigenvalues scattered data analysis, these features will generate texture characteristic curve values tessellation, thus forming a multi-resolution mesh model structure; After testing, the technology is not only surface reconstruction short time, while the constructed subdivision surfaces can reflect the characteristics of the original details of the data.
1933
Authors: Qing Niu, Rong Mo, Neng Wan
Abstract: Process quality control is the core in product’s quality management. To solve the problem of multi-causes process quality diagnosis in manufacturing, an algorithm based on binary tree of quality cause set and intermediate quality is proposed. Firstly, the set of quality cause is divided progressively to form a complete binary tree, and then every node of subsets is chose as non-control cause set to construct the cause-selecting control chart of the intermediate qualities in its parent node. In diagnosis, control charts with same parent are compared to narrow the scope of abnormal quality causes until they are confirmed. Practice proves that the proposed algorithm can make the procedure of quality cause judgment independent to the adjustment, thus the comparison times of control charts could be greatly reduced and the efficiency of diagnosis is highly promoted.
1283
Authors: Qing Hu Wang, Zhi Li Pei, Jie Lian, Bin Wu
Abstract: DNA computing has the support of automata theory completely, based on the equivalent for expressing problem by DNA computing model and the double-shift language in automata theory, using a DNA molecule may encode the instantaneous description of Turing machine, and the operation of continuous sequence can be realized by the DNA molecule s operation with enzymes. Insert - Remove System is a computing system in DNA computing, designed an Binary Tree DNA computing model based on the Insert - Remove System in this paper, which can realize the insert, delete and traversal operation, and has the completeness of the theory.
2062
Authors: Jian Jun Bai, Chao De Yan
Abstract: In order to overcome the incontinuity and redundancy of data storage caused by the grids in representing the multi-resolution terrain, an adaptive hierarchical triangulation based on binary tree is used to represent the multi-resolution terrain model. It realizes the representation of the terrain data at different levels of detail and enables data compression by local omission of data values. The structure of binary tree is stored using a bit code of the underlying binary tree, while the height data are stored using an array, and relative pointers which allow a selective tree traversal. This method realizes the continuity and reduces the data volume in data storage of multi-resolution digital elevation model (DEM), and it is possible to work directly on the compressed data. We show that significant compression rates can be obtained already for small threshold values, and in a visualization application, it is possible to extracted and drawn triangulations at interactive rates.
2628
Authors: Xiao Gui Zhang, Yi Chu, Bo Gao
Abstract: The assembly of a creative combination of mechanical transmission necessitates a certain level of theoretical knowledge and practical skills. College students often lack the capability to effectively apply such theories and skills together. Such a lack results in the low efficiency and poor results in corresponding experiments. In order to solve the problem, an images show is used to simulate the assembly process of a creative combination experiment of mechanical transmission. The assembly path is described through a binary tree. The corresponding relationship between the binary tree and assembly related information is established. Interactive operation of the assembly process is achieved. The system is simple, fast and with no need of large professional software. Typical microcomputers will meet the experiments requirements and purpose.
96
Showing 1 to 10 of 22 Paper Titles