• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.574-576
• /
• 2002

2D 영상을 가지고 인식 작업을 수행하는데 있어서 입력 영상의 질은 매우 중요한 요소이다. 특히 얼굴 인식과 같은 실시간 입력 데이터와 미리 등록되어진 데이터와 비교하는 경우는 입력 영상과 등록 영상의 상태 차이가 크면 좋은 알고리즘이라 할지라도 높은 성능을 내기는 힘들다. 즉, 테스트를 위한 입력 영상을 등록 영상의 수준과 유사하게 만들어 전체적인 성능을 높일 수 있는 적응형 방법이 필요하다. 본 논문에서는 유전 알고리즘을 이용하여, 하나의 샘플 이미지에서 환경 의존적인 요소를 제거 하기 위한 최적의 필터 조합과 특징 추출 마스크를 생성하였으며, 그것을 사용하여 인식 테스트를 수행하였다. 가상의 편향조명 노이즈를 첨가한 실험에서 진화 전의 약 25% 인식율은 진화 후 약 92% 까지 향상되었으며, 임의의 임펄스 노이즈에 관한 실험에서도 진화 전의 약 47%의 인식율에서 진화 후 약 84%의 높은 인식율 향상 결과를 보여주었다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.10 no.16
• /
• pp.113-119
• /
• 1987

A Multistage production-inventory model is developed for deteriorating items. The model is developed deterministic but time-varing demand pattern and instantaneous delivery. Deterioration rates are assumed to vary from period to period. Discrete version of Pontryagin's maximum principle is used to present the efficient alogrithm to solve this model easily. A numerical example is given to illustrate the derived results.

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.471-474
• /
• 2007

본 논문은 연관규칙탐사 기술에서 사용되는 빈발항목집합과 동일한 개념으로 문서분류의 문서에서 빈발단어집합을 정의하고, 이를 사용하여 문서분류 방법으로 잘 알려진 kNN에 적용하였다. 이를 위하여 하나의 문서는 여러 개의 문단으로 나뉘어졌으며, 각 문단에 나타나는 단어들의 집합을 트랜잭션화하여 빈발단어집합을 찾을 수 있도록 하였다. 제안한 방법은 AI::Categorizer 프레임워크에서 구현되었으며 로이터-21578 데이터를 사용하여 학습문서의 크기에 따라 그 정확도가 측정되었다. 정확도의 측정된 결과로 부터 제안된 방법이 기존의 방법에 비하여 정확도를 개선한다는 사실을 알 수 있었다.

• Korean Journal of Optics and Photonics
• /
• v.10 no.5
• /
• pp.405-412
• /
• 1999

We propose an effective algorithm, which can predict the detailed behavior of the intensity-modulated high speed optical signal after propagating through an optical fiber. The alogrithm is based on the SSF (Split Step Fourier) Method, however, the step size is automatically calibrated in each calculation step to reduce the number of calculations within given round-off error bound. Applying the algorithm to the 2.5 Gbps 100 km transmission and 10 Gbps 40 km transmission simulations, we achieved the calculation time reduction by maximum 1/120 and 1/56 of the calculation time by using the SSF fixed step algorithm previously known. The root-mean-square of the round-off error was kept within -30 dB compared to the signal level throughout the calculation.

• Journal of Korean Society of Transportation
• /
• v.26 no.3
• /
• pp.129-141
• /
• 2008

Portable navigation markets grew up to 95% last year. This study aims to develop a business model for pedestrian-oriented portable navigator for street shoppers. Related previous studies developed successfully the alogrithm for a portable navigator, and the current study seeks for diverse ways to turn this system into a new type of on & off line-based LBS business. The business model proposed in this study adopted two different approaches of benefit yields based on the structural analysis of so-called Wanavi navigation system. One is segmented approach seeking for benefits from each individual system component such as communication network, contents, and platform. The other approach is to run the business by integrating relevant system componts in every possible way to attract customers to this portable navigator. The purpose of this proposal is not limited to activate emerging walking navigator markets, but to aim at creating idealistic free market system where all the shoppers are furnished complete market information to the fullest extent when they go on shopping.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.39-47
• /
• 2018

The Dial Algorithm, based on single link based calculation, is unable to reflect cyclic paths arising in actual urban transportation networks. At the same time, redefining the paths more efficiently can, by strict standards, lead to irrational results stemming from reduction in the size of the network to be analyzed. To solve these two problems of the Dial algorithm, the research herein proposes a vine network method applied to a link based Dial Algorithm, in which the original three step alogrithm is modified into a vine network-based three step process. Also, an analysis of two case study networks show feasible replication of the predicted cyclic path, unrealistic flow, and unsteady transit, as well as alleviation of the problem of irrational path allocation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.794-801
• /
• 2000

In this paper, the efficient new performance evaluation method for digital communication channels is suggested and verified its efficiency in terms of simulation run-tim for the digital satellite broadcasting satellite TV channel. In order to solve the difficulties of the existing Importance Sampling(IS) Technics, we adopted the discrete probability mass function(PMF) in the new method for estimating the statistical characteristics of received signals from the measured Nth order central moments. From the discrete probability mass function obtained with less number of the received signal than the one required in the IS technic, continuous cumulative probability function and its inverse function are exactly estimated by using interpolation and extrapolation technic. And the overall channel is simplified with encoding block, inner channel performance degra-dation modeing block which is modeled with the Uniform Random Number Generator (URNG) and concatenated Inverse Cummulative Pr bility Distribution function, and decoding block. With the simplified channel model, the overall performance evaluation can be done within a drastically reduced time. The simulation results applied to the nonlinear digital satellite broadcasting TV channel showed the great efficiency of the alogrithm in the sense of computer run time, and demonstrated that the existing problems of IS for the nonlinear satellite channels with coding and M-dimensional memory can be completely solved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.660-666
• /
• 2014

In this paper, we consider a classification criteria of sensor nodes based on equipment function, and propose a routing search algorithm between node when an IP-USN is applied inside a ship. whereas a tree-type routing algorithm is applied to the limited mobile enviroment, such as engine room or machine room, a mesh-type routing alogrithm is to free mobile enviroment, such as passager corridor liviing quarters or restanrats areas. For mesh-type routing, it is necessary to maintain a seamless route path between a sink node and sensor nodes for which we consider a novel message exchange periodically. We proposed a new message, RDES message, which is issued periodically to update the topology of sensor node and check a connectivity between nodes.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.2A
• /
• pp.285-292
• /
• 2006

In this study, a method determining the local bond-slip model from pure shear test results of CFRP sheet-concrete adhesive joints is proposed and local bond-slip models are presented. Adhesive joints with a specific bond-slip model, which is assumed as multi-linear curve in order to represent arbitary function, are solved numerically. The difference between the solution and test results are minimized for finding the bond-slip model. The model with bilinear curve is also optimized to verify the improvement of multi-linear model. The selected test results are ultimate load-adhesive length curves from a series of adhesive joints and load-displacement curves for each joint. The optimization problem is formulated by physical programming, and the optimized bond-slip model is found using genetic algorithm.

• The KIPS Transactions:PartA
• /
• v.8A no.1
• /
• pp.16-26
• /
• 2001

This paper proposes an extended scheduler model that is an extension of the existing model proposed already in [4, 5], which consists of upper layer task scheduler and lower layer scheduling framework. However, in order to support aperiodic task scheduling, the task scheduler has been divided into two parts, such as periodic task control component and aperiodic task control component. Thus, the proposed model can support various bandwidth-preserving servers that can service aperiodic tasks. The model distinctly separates a classic monolithic kernel scheduler into several kernel components according to their functionality. This enables system developers to implement a new scheduling algorithm or aperiodic task server independent of complex low kernel mechanism, and reconfigure the system at need. In Real-Time Linux [6], we implemented the proposed scheduling framework representative scheduling algorithms, and server bandwidth-preserving servers on purpose to test. Throughout these implementations, we confirmed that a new algorithm or server could be developed independently without updates of complex low kernel modules. In order to verify efficiency of the proposed model, we measured the performance of several aperiodic task servers. The results showed this the performance of model, which even consisted of two hierarchical components and several modules, didnt have such high run-time overhead, and could efficiently support reconfiguration and scheduler development.