• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.1
• /
• pp.103-108
• /
• 2012

In this paper, the optimal design of a spring-type gravity compensation system for an articulated robot is presented. Sequential quadratic programming (SQP) is adopted to resolve various nonlinear constraints in spring design such as stress, buckling, and fatigue constraints, and to reduce computation time. In addition, continuous relaxation method is used to explain the integer-valued design variables. The simulation results show that the gravity compensation system designed by proposed method improves the performance effectively without additional weight gain in the main workspace.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.258-259
• /
• 2021

Forest lodge are divided into forest resources, auxiliary facilities, and users, and are constantly being used along with well-being culture. In addition, attention to the safety of users is also required, and this study aims to study how users evacuate within a short time (golden time) in situations of natural disasters that may occur in forests. In order to search for the current location of the user and find the best evacuation route, 3D scans of the entire forest lodge(forest resources, auxiliary facilities, etc.) are performed, and the optimal trajectory to the evacuation site is found through recognition of the current location. It is believed that it is possible to provide a quick evacuation guide through a mobile device with gps.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.63-74
• /
• 2005

When we introduce the BRT systems, it is very important to decide the operating factors, such as bus-stop locations or headway. If the factors are inappropriate, unessential expenses for the operator and users of the bus line may be caused, and it leads increase of social total cost. So, it is necessary that we consider users' origin and destination of each bus line when we set location of bus-stops and the optimal headway. Meanwhile, Smart Card System was introduced of fare collection for the Public Transportation Reform in Seoul last year. This new card system makes it possible to store up the information about bus operating and passenger's trip link. With these substantial information. we can estimate bus-stop-based O-D table. So, in this thesis, it was studied a systematic methodology to find the optimal location and headway for skip-stop bus system (as a type of first step for BRT). The proposed methodology in this thesis is expected to be useful to effect analysis or setting operating factors for skip-stop bus system in each bus line.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.268-271
• /
• 2003

There are several methods for the design of 2D filter. Notable among them is McClellan transform method. This transform allows us to obtain a high order 2D FIR filter through mapping the 1D frequency points of a 1D prototype FIR filter onto 2D frequency contours. We design 2D filter using this transform. Then we notice for mapping deviation of the 2D filter. In this paper, Quadratic programming (QP) method allows us to obtain coefficients of McClellan transform. Then we compare deviation of QP method with least-squares(LS) method. Elliptic filter is used for comparison. The optimal cutoff frequencies of a 1D filter are obtained directly from the QP method. Also several problem of LS method are solved.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.107-113
• /
• 2016

Visual discomfort is a common problem in three-dimensional videos. Among the methods to overcome visual discomfort presented in current research, disparity adjustment methods provide little guidance in determining the condition for disparity control. We propose a diaprity adjustment based on the characteristics of disparity distribution on visual comfort, where the visual comfort level is used as the adjustment paramter, in parallax barrier type auto-stereoscopic 3D display. In this paper, we use the horizontal image shift method for disparity adjustment to enhance visual comfort. The speeded-up robust feature is used to estimate the disparity distribution of 3D sequences, and the required amount for disparity control is chosen based on the pre-defined characteristics of disparity distribution on visual comfort. To evaluate the performance of the proposed method, we used a 3D equipment. Subjective tests were conducted at the fixed optimal viewing distance. The results show that comfortable videos were generated based on the proposed disparity adjustment method.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.5
• /
• pp.145-151
• /
• 2012

New design of catalytic converter is proposed by optimization of DFSS (Design For Six Sigma) and DOE (Design Of Experiment) method which is based on taguchi matrix. As a result of the optimization of design of catalytic converter, this paper classifies Exhaust-downpipe shapes with 3 parameters to increase flow velocity uniformity of front catalytic substrate face from CFD results. after finishing with L9 Taguchi test matrix, it can be found the main effect of each design parameter of concept model, and optimal design level. in conclusion, it can be increase flow uniformity from 0.60 upto 0.80 with optimal diffuser shape for Turbo-charger.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.762-764
• /
• 1998

완전 이진트리의 통신형태를 갖는 분활 정복방식의 알고리즘 병렬 컴퓨터에서 실행시킬 때 작업들을 프로세서에 분배하여 처리하게 되는데 이때 통신 링크의 충돌을 줄이는 것이 전체 실행시간을 단축하는 중요한 요소가 된다. 본 논문에서는, 웜홀 라우팅과 양방향 링크를 지원하는 3차원 메쉬로의 완전 이진트리의 임베딩 문제를 다룬다. 이 임베딩 방법은 순위차원 라우팅을 사용하며 링크 충돌이 없는 방법으로 최적의 임베딩 알고리즘이다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.51-61
• /
• 2004

In the dental field, the 3D tooth model in which each tooth can be manipulated individually is an essential component for the simulation of orthodontic surgery and treatment. To reconstruct such a tooth model from CT slices, we need to define the accurate boundary of each tooth from CT slices. However, the global threshold method, which is commonly used in most existing 3D reconstruction systems, is not effective for the tooth segmentation in the CT image. In tooth CT slices, some teeth touch with other teeth and some are located inside of alveolar bone whose intensity is similar to that of teeth. In this paper, we propose an image segmentation algorithm based on B-spline curve fitting to produce smooth tooth regions from such CT slices. The proposed algorithm prevents the malfitting problem of the B-spline algorithm by providing accurate initial tooth boundary for the fitting process. This paper proposes an optimal threshold scheme using the intensity and shape information passed by previous slice for the initial boundary generation and an efficient B-spline fitting method based on genetic algorithm. The test result shows that the proposed method detects contour of the individual tooth successfully and can produce a smooth and accurate 3D tooth model for the simulation of orthodontic surgery and treatment.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.5
• /
• pp.949-959
• /
• 2012

This article is to find the right size of decision trees that performs better for boosting algorithm. First we defined the tree size D as the depth of a decision tree. Then we compared the performance of boosting algorithm with different tree sizes in the experiment. Although it is an usual practice to set the tree size in boosting algorithm to be small, we figured out that the choice of D has a significant influence on the performance of boosting algorithm. Furthermore, we found out that the tree size D need to be sufficiently large for some dataset. The experiment result shows that there exists an optimal D for each dataset and choosing the right size D is important in improving the performance of boosting. We also tried to find the model for estimating the right size D suitable for boosting algorithm, using variables that can explain the nature of a given dataset. The suggested model reveals that the optimal tree size D for a given dataset can be estimated by the error rate of stump tree, the number of classes, the depth of a single tree, and the gini impurity.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.397-406
• /
• 2007

The problem of finding an optimal alignment between sequence A and B can be solved by dynamic programming algorithm(DPA) efficiently. But, if the length of string was longer, the problem might not be solvable because it requires O(m*n) time and space complexity.(where, $m={\mid}A{\mid},\;n={\mid}B{\mid}$) For space, Hirschberg developed a linear space and quadratic time algorithm, so computer memory was no longer a limiting factor for long sequences. As computers's processor and memory become faster and larger, a method is needed to speed processing up, although which uses more space. For this purpose, we present an algorithm which will solve the problem in quadratic time and linear space. By using division method, It computes optimal alignment faster than LSA, although requires more memory. We generalized the algorithm about division problem for not being divided into integer and pruned additional space by entry/exit node concept. Through the proofness and experiment, we identified that our algorithm uses d*(m+n) space and a little more (m*n) time faster than LSA.