• Journal of the military operations research society of Korea
• /
• v.17 no.2
• /
• pp.72-89
• /
• 1991

In transportation network problems, it is often desirable to select multiple number of the shortect paths. On problems of finding these paths, algorithms have been developed to choose single shortest path, k-shortest paths and k-shortest paths via p-specified nodes in a network. These problems consider the time as the main factor. In wartime, we must consider availability as well as time to determine the shortest transportation path, since we must take into account enemy's threat. Therefore, this paper addresses the problem of finding the shortest transportation path considering both time and availability. To accomplish the objective of this study, values of k-shortest paths are computed using the algorithm for finding the k-shortest paths. Then availabilties of those paths are computed through simulation considering factors such as rates of suffering attack, damage and repair rates of the paths. An optimal path is selected using any one of the four decision rules that combine the value and availability of a path.

• Journal of Arbitration Studies
• /
• v.23 no.4
• /
• pp.77-96
• /
• 2013

International Arbitration has distinguished itself as a method for dispute resolution that pleases both common and civil law practitioners. It, however, is not free of criticism, especially when fact-finding and evidentiary issues are at play. Perhaps because fact-finding is very closely linked to the culture in which they lie, perhaps because of the lack of a clear evidentiary rules governing international arbitration, a theory of evidence in international arbitration is still far fetched. Through the analysis of the distinctions between dispute resolution systems and the search for truth paradigm, this paper aims to develop and present an outline for the development of a theory of evidence in international arbitration.

• Journal of KIISE:Databases
• /
• v.37 no.5
• /
• pp.267-274
• /
• 2010

Recently, color harmony that decides the value of design is becoming important. In the paper, we propose a method that allows us to easily use harmonious colors in computer systems. Since existing work has focused on finding new color harmony rules or rules that translate emotional words into colors, a method that models these rules in the computer system has not been discussed in depth. In this paper, we model a color system and color harmony rules as a relational database and queries on this database, respectively.

• Current Industrial and Technological Trends in Aerospace
• /
• v.6 no.2
• /
• pp.11-21
• /
• 2008

This paper focuses on finding the way of aerospace industry promotion in Korea compatible with fair trade system under international rules by considering and analysing the WTO subsidy rules and WTO dispute settlement cases. As for subsidy rules in WTO, the paper deals with two matters such as financial contribution and benefit and further studies provisions on the prohibited subsidies and actionable subsidies. And as for the dispute settlement matters, it reviews the Brazil-Canada case and the US-EC case on civil aircraft export subsidies. While aerospace industry in Korea is not yet internationally competitive still requiring government's continuous supports, it must not be in conflict with subsidy rules under WTO mechanism. This paper makes several suggestions to meet these conditions.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.1-12
• /
• 2009

There exist some regular multiple relations in the intervals of notes when they are combined within one measure. This paper presents a method to find the exact measure positions in monophonic song based on those relations. In the proposed method the individual intervals are segmented at first and the rules that state the multiple relations are used to find the measure position. The measures can be applied as the foundational information for extracting beat and tempo of a song which can be used as background knowledge of automatic music transcription system. The proposed method exactly detected the measure positions of 11 songs out of 12 songs except one song which consist of monophonic voice song of the men and women. Also one can extract the information of beat and tempo of a song using the information about extracted measure positions with music theory.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.423-432
• /
• 2009

Advances in information and communication technologies are changing our society greatly. In knowledge-based society, information can be obtained easily via communication tools such as web and e-mail. However, obtaining right and up-to-date information is difficult in spite of overflowing information. The concept of adaptive web site has been initiated recently. The purpose of the site is to provide information only users want out of tons of data gathered. In this paper, an algorithm is developed for adaptive web site construction. The proposed algorithm is based on association rules that are major principle in adaptive web site construction. The algorithm is constructed by analysing log data in web server and extracting meaning documents through finding behavior patterns of users. The proposed algorithm has the following characteristics. First, it is superior to existing algorithms using association rules in time complexity. Its superiority is proved theoretically. Second, the proposed algorithm is effective in space complexity. This is due to that it does not need any intermediate products except a linked list that is essential for finding frequent item sets.

• Journal of the Korea Society for Simulation
• /
• v.21 no.1
• /
• pp.9-17
• /
• 2012

War-game simulation models the situation of a battlefield and has been used for evaluating fighting power and analyzing the occupation of a troop. However, in war-game simulation environment, it is very complex to consider all factors which can be influenced in real battlefields. To solve the problem of the consideration, we propose an ontology-based path finding model. This model uses an ontology to conceptualize the situation data of a battlefield and represents the relations among the concepts. In addition, we extract new knowledge from the war-game ontology by defining some inference rules and share knowledge by the established rules. For the performance evaluation of the proposed model, we made a limitation on the simulation environment and measure the moving time of a troop, the fighting capability of a troop, and the necessary cost while a troop is moving. Experimental results show that this model provides many advantages in aspects of the moving time, a loss of fighting capability, and the necessary cost.

• Journal of Information Technology Services
• /
• v.16 no.1
• /
• pp.73-82
• /
• 2017

Recently in-memory data stream processing has been actively applied to various subjects such as query processing, OLAP, data mining, i.e., frequent item sets, association rules, clustering. However, finding regular periodic patterns of events in an infinite data stream gets less attention. Most researches about finding periods use autocorrelation functions to find certain changes in periodic patterns, not period itself. And they usually find periodic patterns in time-series databases, not in data streams. Literally a period means the length or era of time that some phenomenon recur in a certain time interval. However in real applications a data set indeed evolves with tiny differences as time elapses. This kind of a period is called as a pseudo-period. This paper proposes a new scheme called FPMH (Finding Periods using Multiple Hash functions) algorithm to find such a set of pseudo-periods over a data stream based on multiple hash functions. According to the type of pseudo period, this paper categorizes FPMH into three, FPMH-E, FPMH-PC, FPMH-PP. To maximize the performance of the algorithm in the data stream environment and to keep most recent periodic patterns in memory, we applied decay mechanism to FPMH algorithms. FPMH algorithm minimizes the usage of memory as well as processing time with acceptable accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1283-1293
• /
• 2014

In ubiquitous environment, data are changing rapidly and new data is coming as times passes. And sometimes all of the past data will be lost if there is not sufficient space in memory. Therefore, there is a need to make rules and combine it with new data not to lose all the past data or to deal with large amounts of data. In making decision trees and extracting rules, the weight of each of rules is generally determined by the total number of the class at leaf. The computational problem of finding a minimum finite state acceptor compatible with given data is NP-hard. We assume that rules extracted are not correct and may have the loss of some information. Because of this precondition. this paper presents a new approach for refining rules. It controls their weight of rules of previous knowledge or data. In solving rule refinement, this paper tries to make a variety of rules with pruning method with majority and minority properties, control weight of each of rules and observe the change of performances. In this paper, the decision tree classifier with extended data expression having static weight is used for this proposed study. Experiments show that performances conducted with a new policy of refining rules may get better.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.81-86
• /
• 2002

In current CBR(Case-Based Reasoning) systems, the case adaptation is usually performed by rule-based method that use rules hand-coded by the system developer. So, CBR system designer faces knowledge acquisition bottleneck similar to those found in traditional expert system design. In this thesis, 1 present a model for learning method of case adaptation knowledge using case base. The feature difference of each pair of cases are noted and become the antecedent part of an adaptation rule, the differences between the solutions in the compared cases become the consequent part of the rule. However, the number of rules that can possibly be discovered using a learning algorithm is enormous. The first method for finding cases to compare uses a syntactic measure of the distance between cases. The threshold fur identification of candidates for comparison is fixed th the maximum number of differences between the target and retrived case from all retrievals. The second method is to use similarity metric since the threshold method may not be an accurate measure. I suggest the elimination method of duplicate rules. In the elimination process, a confidence value is assigned to each rule based on its frequency. The learned adaptation rules is applied in riven target Problem. The basic. process involves search for all rules that handle at least one difference followed by a combination process in which complete solutions are built.