• 대한산업공학회지
• /
• 제30권4호
• /
• pp.285-293
• /
• 2004

In this study, a machine grouping problem for the formation of manufacturing cells is considered. We constructed the problem as minimizing manufacturing leadtime consisting of parts' processing, moving, and waiting time. Specifically, the main objective of the defined problem is established as minimizing inter-cell traffic in order to minimize the part's moving time. In addition, to reduce the waiting time of parts, the load balance among cells is implicitly included as constraints. Since this problem is well known as NP-complete and cannot be solved in polynomial time, a genetic algorithm is implemented to obtain solutions. Also, a local optimization algorithm is applied in order to improve the solution by the genetic algorithm. Several experiments show that the suggested algorithms guarantee near optimal solutions in a few seconds.

• Journal of Multimedia Information System
• /
• 제4권4호
• /
• pp.219-224
• /
• 2017

This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 춘계학술발표논문집 (중)
• /
• pp.1269-1272
• /
• 2003

무선랜은 무선으로 근거리 단말들을 연결하는 통신 기술로, 높은 데이터 전송률을 제공할 수 있다. 무선랜은 보통 하나의 AP와 하나 이상의 단탈 기기가 BSS를 구성하는데 AP에서 거리가 멀리 떨어진 단말은 신호의 세기가 약해지므로 고속 데이터 전송률의 보장을 반을 수 없는 단점을 가지고 있다. 본 논문에서는 무선 단말중 일부를 리피터로 이용함으로써 그룹화를 통해 고속 데이터 전송을 가능하게 하는 방법을 제안하고, 시뮬레이션을 통해 무선 단말의 그룹화를 위한 깊이우선탐색 알고리즘과 넓이우선탐색 알고리즘을 비친, 분석하였다. 그 결과 넓이우선탐색 알고리즘이 무선 단말을 위한 그룹화에 보다 효과적인 알고리즘임을 보였다.

• 음성과학
• /
• 제7권2호
• /
• pp.177-189
• /
• 2000

This paper investigates how individual speakers' speech can be distinguished using acoustic parameters such as amplitude, pitch, and formant frequencies. Word samples from fifteen male speakers in their 20's in three different regions were recorded in two different modes (i.e., casual and clear speech) in quiet settings, and were analyzed with a Praat macro scrip. In order to determine individual speakers' acoustical values, the total duration of voicing segments was measured in five different timepoints. Results showed that a high correlation coefficient between $F_1\;and\;F_2$ in formant frequency was found among the speakers although there was little correlation coefficient between amplitude and pitch. Statistical grouping shows that individual speakers' voices were not reflected in regional dialects for both casual and clear speech. In addition, the difference of maximum and minimum in amplitude was about 10 dB which indicates a perceptually audible degree. These acoustic data can give some meaningful guidelines for implementing algorithms of speaker identification and speaker verification.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2455-2458
• /
• 2003

In this paper, the Classification of Energy Labeling has been Proposed. Energy Parameters of input signal which is extracted from each phoneme is labelled. And groups of labelling according to detected energies of input signals are detected. Next, DTW processes in a selected group of labeling. This leads to DTW processing faster than a previous algorithm. In this Method, because an accurate detection of parameters is necessary on the assumption in steps of a detection of speeching duration and a detection of energy parameters, variable windows which are decided by pitch period is used. Extract algorithms don't search for exact frame energy, because 256 frame window-sizes is fixed. For this reason, a new energy extraction method has been proposed. A pitch period is detected firstly; next window scale is decided between 200 frames and 300 frames. The proposed method make it possible to cancel an influence of windows.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2004년도 추계학술대회 논문집
• /
• pp.439-444
• /
• 2004

A new efficient intelligent machining strategy named the Steepest Directed Tree method is presented in this study, which makes surface model discrete with triangulation meshes and the cutter paths track along the tree directions. In order to formulate these algorithms practically, it is deduced the multi-stage machining approach of uncut volume caused by cutter gouging in the course of milling using flat end mill. It is systematized the checking process the cutter interference by grouping the 6 kinds of gouging types, which yields the environment of connectivity data lists including CL-data, and then the multi-stage machining strategy, that minimizes uncut area by continuously sequencing the generative subsequent CL-paths, is shamed to determine the second tool path for the next uncut area and to compose the operating multi-stage cutting processes. The completed machining system of curved surfaces is evaluated by testing the practical machining experiments which have various kinds of shape conditions.

• 한국시뮬레이션학회논문지
• /
• 제9권2호
• /
• pp.75-87
• /
• 2000

In this paper, nonstationary multiple sampling plans are discussed which are difficult to solve by analytical method when there exists dependency between the sample data. The initial solution is found by the sequential sampling plan using the sequential probability ration test. The number of acceptance and rejection in each step of the multiple sampling plan are found by grouping the sequential sampling plan's solution initially. The optimal multiple sampling plans are found by simulation. Four search methods are developed U and the optimum sampling plans satisfying the Type I and Type ll error probabilities. The performance of the sampling plans is measured and their algorithms are also shown. To consider the nonstationary property of the dependent sampling plan, simulation method is used for finding the lot rejection and acceptance probability function. As a numerical example Markov chain model is inspected. Effects of the dependency factor and search methods are compared to analyze the sampling results by changing their parameters.

• 산업공학
• /
• 제16권spc호
• /
• pp.123-126
• /
• 2003

In this paper, we use three cluster algorithms (K-means, Self-Organizing Map, and Fuzzy K-means) to find proper graded stock market brokerage commission rates based on the cumulative transactions on both stock exchange market and HTS (Home Trading System). Stock trading investors for both modes are classified in terms of the total transaction as well as the corresponding mode of investment, respectively. Empirical analysis results indicated that fuzzy K-means cluster analysis is the best fit for the segmentation of customers of both transaction modes in terms of robustness. We then propose the rules for three grouping of customers based on decision tree and apply different brokerage commission to be 0.4%, 0.45%, and 0.5% for exchange market while 0.06%, 0.1%, 0.18% for HTS.

• ETRI Journal
• /
• 제33권4호
• /
• pp.547-557
• /
• 2011

This study presents an approach for extracting boundaries of various buildings, which have concave boundaries, inner yards, non-right-angled corners, and nonlinear edges. The approach comprises four steps: building point segmentation, boundary tracing, boundary grouping, and regularization. In the second and third steps, conventional algorithms are improved for more accurate boundary extraction, and in the final step, a new algorithm is presented to extract nonlinear edges. The unique characteristics of airborne light detection and ranging (LIDAR) data are considered in some steps. The performance and practicality of the presented algorithm were evaluated for buildings of various shapes, and the average omission and commission error of building polygon areas were 0.038 and 0.033, respectively.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 1999년도 추계학술대회
• /
• pp.565-574
• /
• 1999

In reverse engineering area, it is rapidly developing reconstruction of surfaces from scanning or digitizing data, but geometric models of existing objects unavailable many industries. This paper describes new methodology of reverse engineering area, good strategies and important algorithms in reverse engineering area. Furthermore, proposing reconstruction of surface technique is presented. A method find base geometry and blending surface between them. Each based geometry is divided by triangular patch which are compared their normal vector for face grouping. Each group is categorized analytical surface such as a part of the cylinder, the sphere, the cone, and the plane that mean each based geometry surface. And then, each based geometry surface is implemented infinitive surface. Infinitive average surface's intersections are trimmed boundary representation model reconstruction. This method has several benefits such as the time efficiency and automatic functional modeling system in reverse engineering. Especially, it can be applied 3D scanner and 3D copier.