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

Much of previous attention on researches of the decision tree focuses on the splitting criteria and optimization of tree size. Nowadays the quantity of the data increase and relation of variables becomes very complex. And hence, this comes to have plenty number of unnecessary node and leaf. Consequently the confidence of the explanation and forecasting of the decision tree falls off. In this research report, we propose some decision tree algorithms considering the interaction of predictor variables. A generic algorithm, the k-1 Algorithm, dealing with the interaction with a combination of all predictor variable is presented. And then, the extended version k-k Algorithm which considers with the interaction every k-depth with a combination of some predictor variables. Also, we present an improved algorithm by introducing control parameter to the algorithms. The algorithms are tested by real field credit card data, census data, bank data, etc.

• 전자공학회논문지B
• /
• 제33B권2호
• /
• pp.187-196
• /
• 1996

This paper introduces the concept of fixed weights and proposes an algorithm for classification by adding this concept to vector space separation method in LVQ. The proposed algorithm is based on competitive learning. It uses fixed weightsfor generality and fast adaptation efficient radius for new weight creation, and L1 distance for fast calcualtion. It can be applied to many fields requiring adaptive learning with the support of generality, real-tiem processing and sufficient training effect using smaller data set. Recognition rate of over 98% for the train set and 94% for the test set was obtained by applying the suggested algorithm to on-line handwritten recognition.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.337-340
• /
• 1999

At each iteration, the path is either extended by adding a new node, or contracted by deleting its terminal node. When the destination becomes the terminal node of the path, the algorithm terminate. In the process of finding the shortest path to given destination, the algorithm visits other node, there by obtaining a shortest path from the origin to them. We show here that when the auction algorithm is applied to this equivalent program with some special rules for choosing the initial object prices and the person submitting a bid at each iteration, one obtains the generic form of the $\varepsilon$-relaxation method. Thus, the two methods are mathematically equivalent

• 대한전자공학회논문지TC
• /
• 제39권7호
• /
• pp.30-37
• /
• 2002

본 논문에서는 무선 ATM 망에서 VBR(Variable Bit Rate) 트래픽의 QoS(Quality of Service)를 보장하고 무선 채널의 효율성을 극대화 할 수 있는 새로운 적응적 슬롯 할당 알고리즘인 In-VDSA를 제안한다. 제안된 알고리즘에서는 ATM 셀 헤더 부분의 GFC(Generic Flow Field) 필드 상에 단말기의 버퍼 상태를 부호화하여 piggybacking하는 방식을 채택하였으며 다음 프레임에 할당할 슬롯의 개수를 기존의 다른 방식과는 달리 유동적으로 조절하여 할당함으로써 단말기의 셀 손실이나 지연에 대한 QoS를 보장하고 채널 이용 효율을 높일 수 있었다. 제안된 알고리즘은 BONeS tool을 이용한 시뮬레이션을 통하여 기존의 방식과 비교 분석한 결과 그 정당성을 확인하였다.

• 한국통신학회논문지
• /
• 제27권5C호
• /
• pp.435-444
• /
• 2002

본 논문에서는, 세션별 결정적 지연품질의 보장이 주어짐과 동시에, 세션간 서비스품질의 안정성이 지원되는 패킷 스케쥴링 알고리즘인 "클래스별 서비스 차등제공" (CSL: Class level Service Lagging) 알고리즘[6]에 대하여, 시뮬레이션을 통한 기능 검증과, 실질적 구현에 관련된 이슈를 분석하였다. 서비스품질의 안정성 면에서 CSL알고리즘과 EDD(Earliest Due Date) 방식과의 차별성을 확인하였다. 구현의 복잡성에 대한 검토에서, CSL알고리즘은 sorting을 제외하고는, 0(1)의 복잡성을 갖도록 구현될 수 있음을 보였다. 공평큐잉의 기본 골격이 유지됨으로써, 다양한 형태의 공평큐잉 구현에 쉽게 적용될 수 있는 점은 CSL알고리즘이 갖는 주요 특징이다. TCP/IP 네트워크에서와 같이, 사용자의 의지에 의존하는 TCP 혼잡제어의 환경에서, 세션간 서비스품질의 안정성 보장은 필수적이며, 이러한 측면에서 CSL알고리즘이 갖는 적합성을 확인하였다.합성을 확인하였다.

• Journal of Ship and Ocean Technology
• /
• 제2권1호
• /
• pp.42-57
• /
• 1998

Genetic Algorithm (GA) is applied to obtain optimal Inspection plan for fatigue deteriorating structures. The optimization problem is defined so as to minimize inspection cost in the 1ifs-time of the structure under the constraint that the increment of failure probability in each inspection interval is maintained below a target value. Optimization parameters are the inspection timing and the inspection quality. The inspection timing is selected from the discrete intervals such as one year, two years, three years, etc. The inspection quality is selected from the followings; no inspection, normal inspection, sampling inspection or precise inspection. The applicability of the proposed GA approach is demonstrated through the numerical calculations assuming a structure consisting of four member sets. Influences of the level of target failure probability, initial defect condition and stress increase due to plate thickness reduction caused by corrosion on inspection planning are discussed.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2002년도 춘계종합학술대회
• /
• pp.134-138
• /
• 2002

The human faces do not have distinct features unlike other general objects. In general the features of eyes, nose and mouth which are first recognized when human being see the face are defined. These features have different characteristics depending on different human face. In this paper, We propose a face recognition algorithm using the hidden Markov model(HMM). In the preprocessing stage, we find edges of a face using the locally adaptive threshold scheme and extract features based on generic knowledge of a face, then construct a database with extracted features. In training stage, we generate HMM parameters for each person by using the forward-backward algorithm. In the recognition stage, we apply probability values calculated by the HMM to input data. Then the input face is recognized by the euclidean distance of face feature vector and the cross-correlation between the input image and the database image. Computer simulation shows that the proposed HMM algorithm gives higher recognition rate compared with conventional face recognition algorithms.

• 한국군사과학기술학회지
• /
• 제10권2호
• /
• pp.61-68
• /
• 2007

In a naval combat system, the information processing node is a key functional equipment and performs major combat management functions including control sensor and weapon systems. Therefore, a failure of one of the node causes fatal impacts on overall combat system capability. There were many methodologies to enhance system availability by reducing the impact of system failure like a fault tolerant method. This paper proposes a fault tolerant mechanism for information processing node using a replication algorithm with hardware duplication. The mechanism is designed as a generic algorithm and does not require any special hardware. Therefore all applications in combat system can use this functionality. The asynchronous characteristic of this mechanism provides the capability to adapt this algorithm to the module which has low performance hardware.

• 산업공학
• /
• 제16권spc호
• /
• pp.14-20
• /
• 2003

This paper presents a multi-criteria decision model and Multi-Criteria Generic Algorithm(MCGA) approach to improve backbone topology by leveraging the Virtual Link(VL) system in an hierarchical Link-State(LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in an hierarchical LS domain, the importance of this research is evident. The proposed decision model is to find an optimal configuration of VLs that properly meets two-pronged engineering goals in installing and maintaining VLs: i.e., operational costs and network reliability. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only engineering aspects but also specific benefits from systematical layout of VLs, thereby presenting the validity of the decision model and MCGA.

• 전자공학회논문지B
• /
• 제33B권9호
• /
• pp.97-106
• /
• 1996

In this paper, we propose a face recognition algorithm using the hidden markov model and neural networks (HMM-NN). In the preprocessing stage, we find edges of a face using the locally adaptive threshold (LAT) scheme and extract features based on generic knowledge of a face, then construct a database with extracted features. In the training stage, we generate HMM parameters for each person by using the forward-backward algorithm. In the recognition stage, we apply probability vlaues calculated by the HMM to subsequent neural networks (NN) as input data. Computer simulation shows that the proposed HMM-NN algorithm gives higher recognition rate compared with conventional face recognition algorithms.