• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.17 no.1
• /
• pp.39-45
• /
• 2009

An Analysis of wind is essential for planning runway direction. As a general rule, the principal traffic runway at an airport should be oriented as closely as practicable in the direction of the prevailing wind. Aircraft are able to maneuver on a runway as long as the wind component at right angles to the direction of landing and taking-off, the cross wind component, is not excessive. ICAO recommends that runway be oriented so that aircraft may be landed at least 95% of the time with allowable cross wind components not exceeding specified limits based upon the airport reference field length. Based on the recommendation, the direction of the runway or runways at an airport can be determined through graphical vector analysis on wind rose. This study is to develop the wind-rose software for planning the optimum runway direction at an airport with the raw wind data based on reliable wind distribution statistics that extend over as long as a period as possible, preferably of not less than 5 years.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.325-328
• /
• 2005

본 논문은 BPM(Business Process Model)에 룰(rule/policy)을 적용하여 3-Tier 구조의 BPM을 제안하고자 한다. 이는 비즈니스 프로세스를 효율적으로 관리하고, 빠르게 변화하는 업무를 비즈니스 프로세스 모델링하고 그에 필요한 응용 프로그램의 개발을 위해 BPM과 CBD(Component Based Development)간의 접목에 초점을 둔다. 이를 통해서 새로운 비즈니스 프로세스를 추가/변경 시, 필요한 응용업무 프로그램 개발 기간 단축을 할 수 있으리라 본다. 은행 비즈니스업무에 대해 비즈니스 프로세스 모델링을 적용 사례로 보여준다.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.171-174
• /
• 2004

Packet classification is an essential architectural component in implementing the quality-of-service (QoS) in today's Internet which provides a best-effort service to ail of its applications. Multiple header fields of incoming packets are compared against a set of rules in packet classification, the highest priority rule among matched rules is selected, and the packet is treated according to the action of the rule. In this Paper, we proposed a new packet classification scheme based on parallel multiple hashing on tuple spaces. Simulation results using real classifiers show that the proposed scheme provides very good performance on the required number of memory accesses and the memory size compared with previous works.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.283-285
• /
• 2001

최근 고객에게 개인화된 서비스를 제공하기 위한 방법의 하나인 CRM 시스템에 대한 연구가 활발히 이루어지고 있다. 본 논문에서는 룰 기반 CRM에서의 효율적인 룰 매칭을 목적으로 하는 시간요소를 고려한 룰 모델을 제안하고자 한다. 룰 매칭 시점관련조건을 고객관련조건과 구분함으로써 룰의 의미를 구조적으로 명백히 파악할 수 있고 룰 매칭 시에 룰 매칭 시점관련조건을 고객관련조건보다 먼저 수행할 수 있으므로 현재 시점에 룰 매칭을 해야 하는 룰들만을 대상으로 전체 고객 데이터를 검색할 수 있다. 이 때 룰 매칭 시간요소조건을 분류하기 위하여 필요한 카데고리 정보를 저장하고 계산 로직의 반복 수행을 막기 위한 목적으로 어휘를 정의하여 사용하는 방법에 대해서 설명한다.

• Journal of Intelligence and Information Systems
• /
• v.8 no.1
• /
• pp.119-139
• /
• 2002

In electronic catalogs, each item is represented as an independent unit while the parts of the item can be composed of a higher level of functionality. Thus, the search for this kind of product database is limited to the retrieval of most similar standard commodities. However, many industrial products need to configure optional parts to fulfill the required specifications. Since there are many paths in finding the required specifications, we need to develop a search system via the configuration process. In this system, we adopt a two-phased approach. The first phase finds the most similar template, and the second phase adjusts the template specifications toward the required set of specifications by the Constraint and Rule Satisfaction Problem approach. There is no guarantee that the most similar template can find the most desirable configuration. The search system needs backtracking capability, so the search can stop at a satisfied local optimal satisfaction. This framework is applied to the configuration of computers and peripherals. Template-based reasoning is basically the same as case-based reasoning. The required set of specifications is represented by a list of criteria, and matched with the product specifications to find the closest ones. To measure the distance, we develop a thesaurus of values, which can identify the meaning of numbers, symbols, and words. With this configuration, the performance of the search by configuration algorithm is evaluated in terms of feasibility and admissibility.

• Communications for Statistical Applications and Methods
• /
• v.6 no.2
• /
• pp.423-432
• /
• 1999

Accelerated life testing of product is commonly used to reduced test time and costs. In this papers is considered when the product is a two component system with lifetimes following the bivariate exponential distribution of Sarkar(1987) using inverse power rule model. Also we derived the maximum likelihood estimators of parameters for asymptotic normality. We compare the mean square error of the proposed estimator for the life distribution under use conditions stree through Monte Carlo simulation.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2592-2594
• /
• 2004

본 연구에서는 갈수록 늘어나는 이메일 문서의 관리를 효율적으로 하기 위한 방법으로 새로운 메일이 도착했을 때 해당 카테고리를 추천받아 사용자가 직접 최적의 분류를 할 수 있는 이메일 추천 에이전트 시스템을 제안한다. 이메일 문서들의 카테고리별 분류 및 해당 폴더 저장에서 핵심이 될 수 있는 정확한 분류를 위해 동적 임계치를 이용한 베이지안 학습 알고리즘을 적용하였으며, 또한 주요 모듈 부분을 확장성과 재 사용성을 위해 컴포넌트화 하였다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.40-49
• /
• 2009

HAO is a ORB engine to support the logic-based CORBA development environments in FPGA. In this papers, in order to support the logic component developments with HAO, we proposes the translation rule from IDL to VHDL, and the generation of skeleton logic code following the rule. It enables to guarantee the interoperability between the components in distributed multi processor environments includes the general purpose processor and FPGAs, and to improve the performance through the usage of logic-circuit.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.2
• /
• pp.129-140
• /
• 2006

The existing CBD development methods deal with the analysis phase in a superficial manner. Applying such a superficial analysis to business applications with a number of subsystems makes analysis models be inconsistent with levels and styles, only depending on experiences of the analysts. This inconsistent analysis might cause more serious problems during the subsequent development phases, resulting in the failure of the projects. In this paper, we propose a rule-based analysis pattern that provides an analysis template for business applications. This pattern analyzes the concepts of business applications by using external events and internal rules that process the events. Employing this pattern, a huge business application can be developed by a couple of co-analysts who work together in a consistent and systematic manner. This paper also describes an efficient way to develop business components with the suggested analysis pattern using banking deposit case study through UML Components development process.