• The korean journal of orthodontics
• /
• v.25 no.2 s.49
• /
• pp.143-152
• /
• 1995

This study was performed, by Finite Element Method, to evaluate the stress distribution on the periodontal tissue according to activation of the various closing loops and to predict the pattern of movement of maxillary incisors. At the same time, bull loop, key-hole loop, T-loop, combination loop and asymmetrical T-loop which were used for retraction of maxillary incisors was analysed by Finite Element Method. The following results were obtained 1. Horizontal force was the greatest in bull loop, the followed by key-hole loop, combination loop, T-loop and initial tooth movement exhibited uncontrolled tipping. 2. Horizontal force in asymmetrical T-loop compared to other closing loops was remarkably decreased, and the intrusive force on the incisors occurred. 3. As torque was increased, the moment was increased as a linear increment. 4. As moment was increased, initial movement of tooth changed to root movement from uncontrolled tipping.

• Journal of Korea Multimedia Society
• /
• v.22 no.4
• /
• pp.417-423
• /
• 2019

This paper presents an evaluation system to determine the completeness of a space map obtained by a visual SLAM(Simultaneous Localization And Mapping) algorithm. The proposed system consists of three parts. First, the proposed system detects the occurrence of loop closing to confirm that users acquired the information from all directions. Thereafter, the acquired map is divided with regular intervals and is verified whether each area has enough map points to successfully estimate users' position. Finally, to check the effectiveness of each map point, the system checks whether the map points are identifiable even at the location where there is a large distance difference from the acquisition position. Experimental results show that space maps whose completeness is proven by the proposed system has higher stability and accuracy in terms of position estimation than other maps that are not proven.

• The korean journal of orthodontics
• /
• v.28 no.1 s.66
• /
• pp.61-74
• /
• 1998

The Purpose of this study was to investigate the stress distribution and tooth displacement at the initial phase produced by 5 types of molar uprighting springs using finite element method. The three dimensional finite element model of lower dentition, bone and springs was composed of 5083 elements and 2071 nodes. The results were as follows: 1. In case of helical spring and root spring, intrusion of lower canine and first premolar were observed md distal tipping, translation and extrusion of lower second molar were observed. 2. In case of T-loop, modified T-loop and box loop, intrusion and distal translation of lower second premolar were observed, and the largest crown distal tipping and translation of lower second molar were observed in T-loop and the smallest were observed in box loop. 3. In case of T-loop with cinch-bact crown distal tipping and translation of lower second molar were decreased, but extrusion was also decreased. 4. With increase of activation in T-loop, mesial translation and won distal tipping of lower second molar were increased and edentulous space was closing, but distal translation of second premolar was also increased. 5. With increase of tip-back bend in T--loop, distal tipping and translation of lower second molar were increased, but extrusion was also increased more largely.

• The korean journal of orthodontics
• /
• v.37 no.6
• /
• pp.407-420
• /
• 2007

The aim of this study was to compare the differences in closing extraction spaces between maxillary first premolar and second premolar extractions using 3-dimensional finite element analysis (FEA). Methods: Maxillary artificial teeth were selected according to Wheeler's dental anatomy. The size and shape of each tooth, bracket and archwire were made from captured real images by a 3D laser scanner and FEA was performed with a 10-noded tetrahedron. A $10^{\circ}$ gable bend was placed behind the bull loop on a $0.017"{\times}0.025"$ archwire. The extraction space was then closed through 12 repeated activating processes for each 2mm of space. Results and Conclusions: The study demonstrated that the retraction of anterior teeth was less for the second premolar extraction than for the first premolar extraction. The anterior teeth showed a controlled tipping movement with slight extrusion, and the posterior teeth showed a mesial-in rotational movement. For the second premolar extraction, buccal movement of posterior teeth was highly increased.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.