• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.193-206
• /
• 2002

In this paper, we design and implement an efficient bulk-loading algorithm for CIR-Tree. Bulk-loading techniques increase node utilization, improve query performance and reduce index construction time. The CIR-tree has variable size of internal node entries since it only maintains minimal dimensions to decriminate child nodes. This property increases fan-out of internal nodes and improves search performance. Even though several bulk-loading algorithms for multi/high-dimensional index structures have been proposed, we cannot apple them to CIR-tree because of the variable size of internal node entries. In this paper, we propose an efficient bulk- loading algorithm for CIR-tree that improves the existing bulk-loading algorithm and accomodates the property of CIR-tree. We also implement it on a storage system MiDAS-III and show superiority of our algorithm through various experiments.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.851-855
• /
• 2009

Constructing CDS in wireless ad-hoc network, it is necessary to make more efficient algorithm that is fast, simple and has low power consumption. It is worried about losing data which brought a bottleneck state from confliction and delay when the nodes are concentrated or CDS is reconstructed. So, after constructing most efficient CDS, It is better not to reconstruct CDS in moveless wireless ad-hoc network. In this paper, we compared and estimated the performance in each situation of a CDS construction algorithm based on Node degree and Energy level.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.2
• /
• pp.267-277
• /
• 2017

One of fundamental problems in developing robust distributed services is how to achieve distributed consensus agreeing some data values that should be shared among participants in a distributed service. As one of algorithms for distributed consensus, Raft is known as a simple and understandable algorithm by decomposing the distributed consensus problem into three subproblems(leader election, log replication and safety). But, the algorithm dose not mention any types of dynamic configuration of participant peers such as adding new peers to a consensus group or deleting peers from the group. In this paper, we present a new consensus algorithm named Raft-D, which supports the dynamic configuration of participant peers by extending the Raft algorithm. For this, Raft-D manages the additional information maintained by participant nodes, and provides a technique to check the connection status of the nodes belonging to the consensus group. Based on the technique, Raft-D defines conditions and states to deal with adding new peers to the consensus group or deleting peers from the group. Based on those conditions and states, Raft-D performs the dynamic configuration process for a consensus group through the log update mechanism of the Raft algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.111-117
• /
• 2008

In this paper, we describes the boxing motion recognition which is used in the part of games, animation. To recognize the boxing motion, we have used two algorithms, one is principle component analysis, the other is dynamic time warping algorithm. PCA is the simplest of the true eigenvector-based multivariate analyses and often used to reduce multidimensional data sets to lower dimensions for analysis. DTW is an algorithm for measuring similarity between two sequences which may vary in time or speed. We introduce and compare PCA and DTW algorithms respectively. We implemented the recognition of boxing motion on the motion capture system which is developed in out research, and depict the system also. The motion graph will be created by boxing motion data which is acquired from motion capture system, and will be normalized in a process. The result has implemented in the motion recognition system with five actors, and showed the performance of the recognition.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.29 no.5
• /
• pp.493-500
• /
• 2009

An ultrasonic signal processing algorithm was developed for extracting the information of cracks generated around the keyway of a turbine rotor disk. B-scan images were obtained by using keyway specimens and an ultrasonic scan system with x-y position controller. The B-scan images were used as input images for 2-Dimensional signal processing, and the algorithm was constructed with four processing stages of pre-processing, crack candidate region detection, crack region classification and crack information extraction. It is confirmed by experiments that the developed algorithm is effective for the quantitative evaluation of cracks generated around the keyway of turbine rotor disk.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2327-2340
• /
• 2000

Existing bulk loading algorithms for multi-dimensional index structures suffer from satisfying both index construction time and retrieval perfonnancc. In this paper, we propose an efficient bulk loading algorithm to construct high dimensional index structures for large data set that overcomes the problem. Although several bulk loading algorithms have been proposed for this purpose, none of them improve both constnlCtion time and search performance. To improve the construction time, we don't sort whole data set and use bisectiou algorithm that divides the whole data set or a subset into two partitions according to the specific pivot value. Also, we improve the search performance by selecting split positions according to the distribution properties of the data set. We show that the proposed algorithm is superior to existing algorithms in terms of construction time and search perfomlance through various experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.49-57
• /
• 2005

In this paper. a CLB-based CPLD low power technology mapping algorithm for trade-off is proposed. To perform low power technology mapping for CPLD, a given Boolean network has to be represented to DAG. The proposed algorithm consists of three step. In the first step, TD(Transition Density) calculation have to be Performed. Total power consumption is obtained by calculating switching activity of each nodes in a DAG. In the second step, the feasible clusters are generated by considering the following conditions : the number of output. the number of input and the number of OR-terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. The proposed algorithm is examined by using benchmarks in SIS. In the case that the number of OR-terms is 5, the experiments results show reduction in the power consumption by 30.73$\%$ comparing with that of TEMPLA, and 17.11$\%$ comparing with that of PLAmap respectively

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.63-71
• /
• 2014

This paper proposes an algorithm that forms the clusters on the basis of hop distance in order to improve the actor coverage and connectivity in the sink-based wireless sensor and actor networks. The proposed algorithm forms the clusters that are distributed evenly in the target area by electing the CHs(Cluster Heads) at regular hop intervals from a sink. The CHs are elected sequentially from the sink in order to ensure the connectivity between the sink and the actors that are located on the CHs. Additionally, the electing are achieved from the area of the higher rate of the sensors density in order to improve the actor coverage. The number of clusters that are created in the target area and the number of the actors that are placed on the positions of the CHs are reduced by forming the clusters with regular distribution and minimizing the overlap of them through the proposed algorithm. Simulations are performed to verify that the proposed algorithm constructs the actor network that is connected to the sink. Moreover, we shows that the proposed algorithm improves the actor coverage and, therefore, reduces the amount of the actors that will be deployed in the region by 9~20% compared to the IDSC algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.9
• /
• pp.1153-1160
• /
• 2010

The detection algorithm for loss of balance had three main parts: one for processing data, another for constructing an internal model, and a third for detecting the loss of balance. The part related to the internal model is the most important part of the algorithm. The purpose of this study is to evaluate the effect of variables associated with the internal model on the success rate of the algorithm. The internal model depends on the type of linearization adopted and the operating period of the algorithm. The design variables were evaluated by performing sensitivity analysis of the variables of the internal model in order to obtain the success rate of the algorithm. The results showed that the most sensitive variable was the period and the period of 0.3 s yielded the highest success rate of 97.1%. Further, the ranges of the design variables that can facilitate a success rate of over 95% are presented.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.782-787
• /
• 2001

In this paper, we propose an growing and pruning algorithm to design the adaptive structure of modular wavelet neural network(MWNN) with F-projection and geometric growing criterion. Geometric growing criterion consists of estimated error criterion considering local error and angel criterion which attempts to assign wavelet function that is nearly orthogonal to all other existing wavelet functions. There criteria provide a methodology that a network designer can constructs wavelet neural network according to one s intention. The proposed growing algorithm grows the module and the size of modules. Also, the pruning algorithm eliminates unnecessary node of module or module from constructed MWNN to overcome the problem due to localized characteristics of wavelet neural network which is used to modules of MWNN. We apply the proposed constructing algorithm of the adaptive structure of MWNN to approximation problems of 1-D function and 2-D function, and evaluate the effectiveness of the proposed algorithm.