• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.94-99
• /
• 1999

In this Paper, the estimation method of painting process in the automobile plant using computer simulation techniques is studied to improve the bottle neck process, the weak point and the productivity. For model and analysis, Promodel is used which is a manufacturing oriented simulation software developed by Promodel corporation in the U.S.A. Firstly the result of the simulation shows that we can obtain capability improvement in the system performance using computer simulation. Secondly, the optimum system specification is decided by comparing reports generated by scenario in simulation program find out the suitable conditions. Finally, the speed of conveyor and a pitch of painting body as the most critical parameters are chosen on the basis of exhaustive field evaluation to study their effects o the capacity of the process. The best alternative condition for the maximum capacity of the process is selected by computer simulation.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.62-69
• /
• 2016

In this paper, we propose two novel user selection algorithms for multiuser multiple-input and multiple-output downlink wireless systems, in which both a base station (BS) and mobile stations (MSs) are equipped with multiple antennas. Linear transmit beamforming at the BS and receive combining at the MSs are used to avoid interference between users and find a better sum-rate capacity performance. An optimal technique for selecting users would entail an exhaustive search, which in practice becomes computationally complex for a realistic number of users. Suboptimal algorithms with low complexity are proposed for a coordinated beamforming scheme. Simulation results show that the performance of the proposed algorithms is better than that provided by previous algorithms and is very close to an optimal approach with reduced complexity.

• Advances in Traditional Medicine
• /
• v.3 no.3
• /
• pp.123-128
• /
• 2003

Stephania hernandifolia belonging to the family Menispermaceae is the biggest storehouse of diphenylbisbenzylisoquinoline (DBBI) alkaloids. Exhaustive chemical processing of the bulb of S. hernandifolia by the application of modern separation techniques yielded a DBBI alkaloid which was identified as cycleanine using spectroscopic methods (UV, IR, $^1HNMR$. $^{13}CNMR$, Mass). Cycleanine showed significant anti-inflammatory activity against carrageenin induced paw oedema, comparable to that produced by diclofenac sodium, used as standard drug. It exhibited potent analgesic effects against chemical and thermal noxious stimuli. It was also found to possess anticonvulsive activity in the strychnine induced convulsion model.

• Phonetics and Speech Sciences
• /
• v.2 no.4
• /
• pp.137-143
• /
• 2010

In this paper, a speech endpoint detection algorithm is proposed. The proposed algorithm is a kind of state transition-based ones for speech detection. To reject short-duration acoustic pulses which can be considered noises, it utilizes duration information of all detected pulses. For the optimization of parameters related with pulse lengths and energy threshold to detect speech intervals, an exhaustive search scheme is adopted while speech recognition rates are used as its performance index. Experimental results show that the proposed algorithm outperforms the baseline state-based endpoint detection algorithm. At 5 dB input SNR for the beamforming input, the word recognition accuracies of its outputs were 78.5% for human voice noises and 81.1% for music noises.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.2
• /
• pp.95-100
• /
• 1997

In this paper, we present a new fast VQ encoding algorithm. The proposed algorithm facilitates two characteristics of a vector, i.e., mean and variance to reject many unlikely codewords and save a lot of computation time. Since the proposed algorithm, which is based upon geometric considerations, rejects those codewords that are impossible to be the closest codeword, it provides the same results as a conventional exhaustive(or full) search algorithm. The simulation results confirm the effectiveness of the proposed algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.4
• /
• pp.9-16
• /
• 2009

본 논문에서는 시스템 연령(年齡)에 의해 보전 활동의 효과를 설명하는 일반 수리(修理) 개념을 이용한 최적 보전(保全) 정책에 대한 연구를 수행하였다. 본 논문에서는 주기적인 일반 수리와 고장 시 최소 수리가 적용되는 최적 보전 정책을 고려하였다. 따라서 일반 수리에 따른 보전 정책의 비용 함수를 도출하였고 최적 보전 정책을 도출하는 알고리즘을 제시하였고 예제를 통해 알고리즘의 성능을 분석하였다. 이 연구를 통해 시스템을 운영하는데 있어서 어느 수준의 보전 정책을 적용하며 어느 정도의 기간 동안 시스템을 유지할 것인지에 대안을 제공할 수 있을 것이다.

• Journal of Microbiology
• /
• v.38 no.2
• /
• pp.62-65
• /
• 2000

Partial sequence comparisons of mitochondrial small subunit rDNA (mt SSU rDNA) were used to examine taxonomic and evolutionary relationships among seven Penicillium species : two monoverticillate species, two biverticillate species, and three terverticillate species. Amplified fragments of mt SSU rDNA highly varied among seven species in size, suggesting the existence of multiple insertions or deletions in the region. A phylogengtic tree was constructed by exhaustive search of parsimony analysis. The phylogenetic tree distinguished two statistically supported monophyletic groups, one for two monoverticillate species and the other for three terverticillate species and ont biverticillate species, P. vulpinum. The phylogenetic relationship of P. waksmanii, the biverticillate species, was not clear.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.639-647
• /
• 1998

We consider a multiclass production system processed by a single machine with cyclic order. Each part belongs to one of several classes and arrives at each queue in a Poisson process. The processing discipline at each queue is either exhaustive or gated. We introduce a new approach to analysis of mean waiting times for each queue. We formulate mean waiting times as cost functions on state of the system. The mean waiting times are obtained by solving a set of O($J^2$) linear equations, where J is the number of queues in the system. We also obtain the mean number of parts of each queue in the system at an arbitrary time. Based on this result, we plot the numerical values of the mean waiting times for several parameter settings.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.267-288
• /
• 1995

We investigate a multiclass priority system with a mixed service discipline, and propose a new approach to the analysis of performance measures (mean waiting times) of the system. Customers are preferentially served in the order of priority. The service discipline at each station is either gated or exhaustive discipline. We formulate mean waiting times as functions on the state of the system. We first consider the system at an arbitrary system state to obtain explicit formulae for the mean waiting times, and then derive their steady state values by using the property of Poisson arrivals to see time averages and the generalized Little's formula.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.188-191
• /
• 2011

Path finding and path planning is crucial in today's world where time is an extremely valuable element. It is easy to plan the optimum path to a destination if provided a map but the same cannot be said for an unknown and unexplored environment. It will surely be exhaustive to search and explore for paths to reach the destination, not to mention planning for the optimum path. This is very much similar to finding for an exit of a maze. A very popular competition designed to tackle the maze solving ability of autonomous called Micromouse will be used as a guideline for us to design our maze. There are numerous ways one can think of to solve a maze such as Dijkstra's algorithm, flood fill algorithm, modified flood fill algorithm, partition-central algorithm [1], and potential maze solving algorithm [2]. We will analyze these algorithms from various aspects such as maze solving ability, computational complexity, and also feasibility to be implemented.