Papers by Keyword: Binary Tree

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.

Abstract: Traversing binary tree is an important algorithm in data structure. This paper analyses and discusses the recursive algorithm implementation of preorder-traversing binary tree through instance. It would contribute beginners to understand more deeply the process of preorder-traversing and enhance their programming.

Abstract: This paper combined with the real conditions on investment and decision-making of grid construction. Considering the uncertainty of project, we applies real option theory into evaluation model of grid construction and establishes evaluation model of grid construction based on real option theory. The result indicates that proper application of real option method into the investment decision-making model of grid construction can better enable grid to obtain profit from investment uncertainty, which provides larger profit and opportunity for grid corporation.

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.

Abstract: With the extensive application of XML, especially in e-commerce field, XML data security has become the focus of people, which particularly shows in its structural attack specific to the location relation to elements in tree structure. Combined with the characteristics of tree structure of XML data as well as the basic features of traversing binary tree, the paper proposes a method to protect the structural-integrity of XML digital signature, so as to protect XML data element from structural attack through the basic features of traversing binary tree, and ensure the absolute location relationship among elements.

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.

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.

Abstract: In this paper we intend to apply a new method to predict tertiary structure. Several feature extraction methods adopted are physicochemical composition, recurrence quantification analysis (RQA) , pseudo amino acid composition (PseAA) and Distance frequency. We construct the binary tree Classification model, and adopt flexible neural tree models as the classifiers. We will train a number of based classifiers through different features extraction methods for every node of binary tree, then employ the selective ensemble method to ensemble them. 640 dataset is selected to our experiment. The predict accuracy with our method on this data set is 63.58%, higher than some other methods on the 640 datasets. So, our method is feasible and effective in some extent.

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.

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.