• Industrial Engineering and Management Systems
• /
• v.10 no.2
• /
• pp.161-169
• /
• 2011

In seeking further efficiency in production preparation, it is common to examine assembly sequences using digital manufacturing. The assembly sequences affect the product evaluation, so it is necessary to test several assembly sequences before actual production. However, because selection and testing of assembly sequences depends on the operator's personal experience and intuition, only a small number of assembly sequences are actually tested. Nevertheless, there is a systematic method for generating assembly sequences using a contact-related figure. However, the larger the number of parts, the larger the number of assembly sequences geometric becomes. The purpose of this study is to establish a systematic method of generating efficient assembly sequences regardless of the number of parts. To generate such assembly sequences selectively, a "Tournament Tree," which shows the structure of an assembly sequence, is formulated. Applying the method to assembly sequences of a water valve, good assembly sequences with the same structure as the Tournament Tree are identified. The structure of such a Tournament Tree tends to have fewer steps than the others. As a test, the structure is then applied for a drum cartridge with 38 parts. In all the assembly sequences generated from the contact-related figures, the best assembly sequence is generated by using the Tournament Tree.

• MALSORI
• /
• no.45
• /
• pp.117-126
• /
• 2003

Decision tree-based state tying has been proposed in recent years as the most popular approach for clustering the states of context-dependent hidden Markov model-based speech recognition. The aims of state tying is to reduce the number of free parameters and predict state probability distributions of unseen models. But, when doing state tying, the size of a decision tree is very important for word independent recognition. In this paper, we try to construct optimized decision tree based on the average of feature vectors in state pool and the number of seen modes. We observed that the proposed optimal decision tree is effective in predicting the state probability distribution of unseen models.

• IE interfaces
• /
• v.15 no.3
• /
• pp.241-246
• /
• 2002

Some extensions of minimum spanning tree problem are NP-hard problem in which polynomial-time solutions for them do not exist. Because of their complexity, recently some researcher have used the genetic algorithms to solve them. In genetic algorithm approach the Prufer number is usually used to represent a tree. In this paper we discuss the problem of the Prufer number encoding method and propose an improved genetic operation. Using a numerical comparison we demonstrate the excellence of the proposed method.

• Korean Journal of Breeding Science
• /
• v.40 no.4
• /
• pp.371-376
• /
• 2008

For the purpose of breeding a high-yield superior variety of Korean raisin tree (Hovenia dulcis var. koreana Nakai), whose value as an edible and medicinal resource is increasing, tree candidates for superior individuals were selected from its 11 habitats in Korea from 1996 to 1998. A clone bank preserve was created in 1998 with 70 clones proliferated by grafting; the fruition traits (e.g., the number of fructified laterals, the average number of bunches per fructified lateral, the average number of bunches per fruiting lateral, the fruitpetiole weight per individual, and the yield per individual) of 47 clones that had bloomed and borne fruit were investigated and analyzed in 2002; five upper-ranking clones whose yield per individual exhibited a 261% improvement against the total average were picked in 2005; and three clones, including 'Poong-Sung 1', that showed a difference in their fruit petiole ripening stage, were finally selected in 2007 as high-yield new cultivars of Korean raisin tree.

• Journal of the military operations research society of Korea
• /
• v.6 no.1
• /
• pp.119-124
• /
• 1980

An efficient algorithm which can be employed in obtaining the minimal cut sets of a fault tree containing repeated events is introduced. A sample fault tree illustrates this algorithm. Efficiency of an algorithm is defined as the ratio of the number of minimal cut sets to the number of cut sets determined by the algorithm. An efficiency of the proposed algorithm is compared with those of two existing algorithms : Fussell and Vesely's algorithm and Bengiamin et al. 's algorithm. The proposed algorithm is shown to be more efficient than the existing two algorithms.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.631-638
• /
• 2018

Chellai et al. [3] gave an upper bound on the [1, 2]-domination number of tree and posed an open question "how to classify trees satisfying the sharp bound?". Yang and Wu [5] gave a partial solution for tree of order n with ${\ell}$-leaves such that every non-leaf vertex has degree at least 4. In this paper, we give a new upper bound on the [1, 2]-domination number of tree which extends the result of Yang and Wu. In addition, we design a polynomial time algorithm for solving the open question. By using this algorithm, we give a characterization on the [1, 2]-domination number for trees of order n with ${\ell}$ leaves satisfying $n-{\ell}$. Thereby, the open question posed by Chellai et al. is solved.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.850-853
• /
• 2018

In this paper, we propose a decoding method using a balanced binary tree and a canonical Huffman tree for efficient decoding of Huffman codes. The balanced binary tree scheme reduces the number of searches by lowering the height of the tree and binary search. However, constructing a tree based on the value of the code instead of frequency of symbol is a drawback of the balanced binary tree. In order to overcome these drawbacks, a balanced binary tree is reconstructed according to the occurrence probability of symbols at each level of the tree and binary search is performed for each level. We minimize the number of searches using a canonical Huffman tree to find level of code to avoid searching sequentially from the top level to bottom level.

• Journal of Forest and Environmental Science
• /
• v.35 no.1
• /
• pp.1-5
• /
• 2019

Species diversity is one of the most important indices that used to evaluate the sustainability of forest communities. In the present study, three variables including number of individuals (frequency of species), basal area and volume of tree species were compared to estimate tree species diversity in broadleaves forests of Iran. Based on systematic random design, 30 plots (circle plot, $1000m^2$) was selected. Type of species, number of species, DBH and height of trees were measured. Simpson (1-D), Hill ($N_2$), Shannon-Wiener (H'), Mc Arthur ($N_1$), Smith-Wilson ($E_{var}$) and Margalef ($R_1$) indices used to estimate tree species diversity. Species diversity was calculated in each plot. ANOVA test showed that there was a significant difference between of three variables used for estimation of species diversity. Number of trees variable has more precision than basal area and volume variables to estimate of species diversity. But Duncan test revealed that there were significant difference between of basal area and volume variables with number of trees. Therefore, basal area and volume variables were selected as more suitable variables in order to estimate of biodiversity indices in northern forests of Iran.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.261-264
• /
• 2001

This paper relates to a node structure of a multiway search tree and a search method using the node structure and, more particularly, to a search method for accelerating its search speed by reducing the depth of each small tree in a multi-way search tree. The proposed idea can increase the number of keys capable of being recorded on a cache line by using one pointer at a node of the multi-way search tree so that the number of branches in a network address search is also increased and thus the tree depth is reduced. As a result, this idea can accelerate the search speed and the speed of the forwarding engine and accomplish a further speed-up by decreasing required memories and thus increasing a memory rate.

• Journal of Communications and Networks
• /
• v.11 no.3
• /
• pp.261-270
• /
• 2009

We propose a tree-based integration of infrastructure networks and MANETs (TUM) to efficiently extend the scope of mobile Internet protocol to mobile ad hoc networks and devise a tree-based routing protocol (TBRP) that is suitable for the TUM architecture. Infrastructure networks have a number of fixed Internet Gateways that connect two heterogeneous networks. Mobile nodes form a number of small trees named pMANETs, each of them growing from anchor node which can communicate directly with an Internet Gateway. A new node registers with foreign agent and home agent along the tree path without resorting to an inefficient flooding. Furthermore, the TBRP sets up a routing path efficiently by exploiting the tree information without relying on flooding. We show by resorting to simulation that our approach is competitive against the conventional AODV based approach.