• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1160-1169
• /
• 1996

In this study, an experiment of information retrieval using fuzzy connection matrix of keywords was conducted. A query for retrieval was constructed from each keyword and Boolean operator such as AND, OR, NOT. In a workstation environment, the performance of the fuzzy retrieval system was proved to be considerably effective than that of the system using the crisp set theory. And both recall ratio and precision ratio showed that the proposed technique would be a possible alternative in future information retrieval. Some special features of this experimental system were ; ranking the results in the order of connectivity, making the retrieval results correspond flexibly by changing the threshold value, trying to accord the retrieval process with the retrieval semantics by treating the averse-connectivity (fuzzy value) as a semantic approximation between kewords.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.481-489
• /
• 2010

Due to the increase of the attention on relation extraction systems, the construction of test collections for assessing their performance has emerged as an important task. In this paper, we propose semi-automatic framework capable of constructing test collections for relation extraction on a large scale. Based on this framework, we develop a test collection which can assess the performance of various approaches to extracting relations between technical terminologies in scientific literatures. This framework can minimize the cost of constructing this kind of collections and reduce the intrinsic fluctuations which may come from the diversity in characteristics of collection developers. Furthermore, we can construct balanced and objective collections by means of controlling the selection process of seed documents and terminologies using the proposed framework.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• Journal for History of Mathematics
• /
• v.21 no.3
• /
• pp.127-142
• /
• 2008

In this paper, we introduce four different approaches of proving Cayley formula, which counts the number of trees(acyclic connected simple graphs). The first proof was done by Cayley using recursive formulas. On the other hands the core idea of the other three proofs is the bijective method-find an one to one correspondence between the set of trees and a suitable family of combinatorial objects. Each of the three bijection gives its own generalization of Cayley formula. In particular, the last proof, done by Seo and Shin, has an application to computer science(theoretical computation), which is a typical example that pure mathematics supply powerful tools to other research fields.

• Journal of the Korean Chemical Society
• /
• v.22 no.2
• /
• pp.67-77
• /
• 1978

MO's of a complex are expanded in terms of the set of Shull-Lowdin functions based on a single point, the nucleus of central metal ion, and the result was interpreted from the viewpoint of perturbation theory. We find that even in the case of $[NiF_6]^{4-}$, which has relatively small covalency, excited configurations with high orbital angular momentum are considerably mixed into $e_g$ and $t_{2g}$, orbitals of central metal ion, and that the distortions in these orbitals differ from each other. Therefore it is concluded that the energy difference between $e^*_g$ and $t^*_{2g}$, orbitals evaluated in the MO scheme has little meaning of the unique parameter 10Dq in the crystal field theory, and that such a unique parameter cannot be defined in a rigorous sense in the MO scheme.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.307-318
• /
• 2008

One of the primary issues confronting XML message brokers is the difficulty associated with processing a large set of continuous XPath queries over incoming XML seams. This paper proposes a novel system designed to present an effective solution to this problem. The proposed system transforms multiple XPath queries before their run-time into a new region-based data structure, called an XP-table, by sharing their common constraints. An XP-table is matched with a stream relation (SR) transformed from a target XML stream by a SAX parser. This arrangement is intended to minimize the runtime workload of continuous query processing. Also, system performance is estimated and verified through a variety of experiments, including comparisons with previous approaches such as YFilter and LazyDFA. The proposed system is practically linear- scalable and stable for evaluating a set of XPath queries in a continuous and timely fashion.

• Journal of Korean Society of Transportation
• /
• v.32 no.6
• /
• pp.694-702
• /
• 2014

Since Greenhouse Gas Inventory & Research Center (GIR) of Korea was founded in 2010, the annual greenhouse gas inventory reports, one of the collections of GIR's major affairs, have been published from 2012. In the reports many items related to greenhouse gas emission quantities are included, but among them uncertainty values are replaced to basic values which IPCC guideline suggests. Even though IPCC guideline suggests the equations of each Tier level in details, the guideline recommends developing nation's own methodology on uncertainty which is closely related to statistical problems such as the estimation of a probability density function or Monte carlo methods. In the road transportation sector the emissions have been calculated by Tier 1 but the uncertainties have not been reported. This study introduce a bootstrap technique and Monte carlo method to estimates annual emission quantity and uncertainty, given activity data and emission factors such as annual traveled distances, fuel efficiencies and emission coefficients.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.3
• /
• pp.252-259
• /
• 2000

In this paper, we propose a Fuzzy Classifier System(FCS) to find a set of fuzzy rules which can carry out the edge detection of a image. The FCS is based on the fuzzy logic system combined with machine learning. Therefore the antecedent and consequent of a classifier in FCS are the same as those of a fuzzy rule. There are two different approaches, Michigan and Pittsburgh approaches, to acquire appropriate fuzzy rules by evolutionary computation. In this paper, we use the Michigan style in which a single fuzzy if-then rule is coded as an individual. Also the FCS employs the Genetic Algorithms to generate new rules and modify rules when performance of the system needs to be improved. The proposed method is evaluated by applying it to the edge detection of a gray-level image that is a pre-processing step of the computer vision. the differences of average gray-level of the each vertical/horizontal arrays of neighborhood pixels are represented into fuzzy sets, and then the center pixel is decided whether it is edge pixel or not using fuzzy if-then rules. We compare the resulting image with a conventional edge image obtained by the other edge detection method such as Sobel edge detection.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.6
• /
• pp.828-833
• /
• 2009

WWW which is an applicable massive set of document on the Web is a thesaurus of various information for users. However, Search engines spend a lot of time to retrieve necessary information and to filter out unnecessary information for user. In this paper, we propose the EFAM(the Extended Fuzzy AHP Method) model to manage the Web resource efficiently, and to make a decision in the problem of specific domain definitely. The EFAM model is concerned with the emotion analysis based on the domain corpus information, and it composed with systematic common concept grids by the knowledge of multiple experts. Therefore, The proposed the EFAM model can extract the documents by considering on the emotion criteria in the semantic context that is extracted concept from the corpus of specific domain and confirms that our model provides more efficient decision-making through an experiment than the conventional methods such as AHP and Fuzzy AHP which describe as a hierarchical structure elements about decision-making based on the alternatives, evaluation criteria, subjective attribute weight and fuzzy relation between concept and object.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.212-217
• /
• 2009

There are rule-based learning method and statistic based learning method and so on which represent learning method for hierarchy relation between domain term. In this paper, we propose to leveling and similarity measure using the extended AHP of fuzzy term in Information system. In the proposed method, we extract fuzzy term in document and categorize ontology structure about it and level priority of fuzzy term using the extended AHP for specificity of fuzzy term. the extended AHP integrates multiple decision-maker for weighted value and relative importance of fuzzy term. and compute semantic similarity of fuzzy term using min operation of fuzzy set, dice's coefficient and Min+dice's coefficient method. and determine final alternative fuzzy term. after that compare with three similarity measure. we can see the fact that the proposed method is more definite than classification performance of the conventional methods and will apply in Natural language processing field.