• Korean Management Science Review
• /
• v.18 no.1
• /
• pp.105-118
• /
• 2001

The common shortest path problem is to find the shortest route between two specified nodes in a transportation network with only one traffic mode. The public transportation network with multiple traffic mode is a more realistic representation of the transportation system in the real world, but it is difficult for the conventional shortest path algorithms to deal with. The genetic algorithm (GA) is applied to solve this problem. The objective function is to minimize the sum of total service time and total transfer time. The individual description, the coding rule and the genetic operators are proposed for this problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.935-938
• /
• 1991

We are developing an automatic adjusting system for ITC. ITC(Integrated Tube Components) has a large set-by-set variability in its characteristics. And it also has nonlinearities. It requires not only a fast vision process but also an efficient control algorithm to meet the need for high productivity. In this paper, the description of an adjusting system and the modelling of ITC will be presented. And also the concept of a new rule based hierarchical algorithmic approaches will be suggested.

• Journal of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.289-309
• /
• 2014

A combinatorial description of the crystal $\mathcal{B}({\infty})$ for finite-dimensional simple Lie algebras in terms of certain Young tableaux was developed by J. Hong and H. Lee. We establish an explicit bijection between these Young tableaux and canonical bases indexed by Lusztig's parametrization, and obtain a combinatorial rule for expressing the Gindikin-Karpelevich formula as a sum over the set of Young tableaux.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.587-592
• /
• 2004

Context-aware computing systems require real-time context reasoning process for context awareness. Context reasoning can be done by comparing input information from sensors with knowledge-base within system. This method is identical with it of rule-based systems. In this paper, we propose hardware rule-based system architecture which can process context reasoning in real-time. Compared to previous architecture, hardware rule-based system architecture can reduce the number of constraints on rule representations and combinations of condition terms in rules. The modified content addressable memory, crossbar switch network and pre-processing module are used for reducing constraints. Using SystemC for description can provide easy modification of system configuration later.

• Journal of Korean Library and Information Science Society
• /
• v.11
• /
• pp.143-173
• /
• 1984

This study has been done to review the historical development of the cataloging system of books with emphasis on those in England and the U. S. The findings can be summarized as follows: (1) In 1844, Sir Panizzi invented what seems to be the first of its kind in history to list the inventory systematically at the British Museum. It is believed to be a complete system consisting of 91 articles. (2) A comparatively systematic system was developed in America by Jewett. in 1852. Composed of only 39 articles, the system is considered a renovative one worked out with due regard to the infrastructure of a library. (3) In 1876, a classic system based on a lexicographical order was set up by Cutter. Rated as the best one that was designed by an individual, the theory has since exercised widespreading effects on cataloging. (4) American and British library scientists collaborated in printing several editions of numerous volumes on the principles of classification, but they are not believed fully successful in establishing a consistent and compressive system. Their efforts found significance rather in their being the first international collaboration and setting a foundation upon which the international system of today has been developed. (5) The ALA Rule, published concurrently in ALA and LC in 1949, had two parts in its classification, the list of authors and that of titles. Its scientific classification has completed the cataloging of books in its developmental stage. (6) The 1967 American-British Rules integrated the cataloging systems published under separate covers by authors and titles. The system as well as the 1961 Paris System has greatly contributed to the standardization of bibliographical description throughout the English-speaking countries. The International Standard Book Description standardized Bibliographic system has enabled the librarians in different countries to exchange their bibliographical sources easily, helped to overcome the language barrier in listing and contributed to the efficient reading of bibliographical records through machines. (7) The second edition of the Angelo-American cataloging Rules, promulgated in 1978 under the influence of the international standard bibliographical description, was the one in which all the previous Rules were revised to have their strong points. The adoption of punctuation system to employ the computerized data processing and the standardization of description are expected to improve the cataloging system not only in the English speaking countries but in the Universal Bibliographic Control as well.

• Journal of the Korean Society for information Management
• /
• v.24 no.3
• /
• pp.119-147
• /
• 2007

Actually a diffusion of a semantic web application and utilization are situations insufficient extremely. Technology most important in semantic web application is construction of the ontology which contents itself with characteristics of semantic web. Proposed a suitable a method of building web ontology for characteristics or semantic web and web ontology as we compared the existing ontology construction ana ontology construction techniques proposed for web ontology construction, and we analyzed. And modeling old ontology to bases to description logic and the any axiom rule that used an expression way of SWRL, and established inference-based web ontology according to proposed ways. Verified performance of ontology established through ontology inference experiment. Also established an web ontology-based intelligence image retrieval system, to experiment systems for performance evaluation of established web ontology, and present an example of implementation of a semantic web application and utilization. Demonstrated excellence of a semantic web application to be based on ontology through inference experiment of an experiment system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.286-290
• /
• 2005

We consider the poisson equation where the functions involved are periodic including the solution function. Let $R=[0,1]{\times}[0,l]{\times}[0,1]$ be the region of interest and let $\phi$(x,y,z) be an arbitrary periodic function defined in the region R such that $\phi$(x,y,z) satisfies $\phi$(x+1, y, z)=$\phi$(x, y+1, z)=$\phi$(x, y, z+1)=$\phi$(x,y,z) for all x,y,z. We describe a very simple method for solving the equation ${\nabla}^2u(x, y, z)$ = $\phi$(x, y, z) based on the cubic spline interpolation of u(x, y, z); using the requirement that each interval [0,1] is a multiple of the period in the corresponding coordinates, the Laplacian operator applied to the cubic spline interpolation of u(x, y, z) can be replaced by a square matrix. The solution can then be computed simply by multiplying $\phi$(x, y, z) by the inverse of this matrix. A description on how the storage of nearly a Giga byte for $20{\times}20{\times}20$ nodes, equivalent to a $8000{\times}8000$ matrix is handled by using the fuzzy rule table method and a description on how the shape preserving property of the Laplacian operator will be affected by this approximation are included.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.235-244
• /
• 2004

We propose a format of a binary phrase structure grammar with composite labels. The grammar adopts binary rules so that the dependency between two sub-trees can be represented in the label of the tree. The label of a tree is composed of two attributes, each of which is extracted from each sub-tree so that it can represent the compositional information of the tree. The composite label is generated from part-of-speech tags using an automatic labeling algorithm. Since the proposed rule description scheme is binary and uses only part-of-speech information, it can readily be used in dependency grammar and be applied to other languages as well. In the best-1 context-free cross validation on 31,080 tree-tagged corpus, the labeled precision is 79.30%, which outperforms phrase structure grammar and dependency grammar by 5% and by 4%, respectively. It shows that the proposed rule description scheme is effective for parsing Korean.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.77-86
• /
• 1996

In managing a certain database, the integrity of data is very important. The important. The integrity constrains thus should be considered carefully when a database is designed and, after the database is created, it is required for a database manager to check continuously if some data contained in the database violate the integrity constraints considered. It is however not easy to check the violateion of integrity constraints when the size and the complexity of database are increased. This paper suggests a rule-based database verification system to relax the difficulty of checking the integrity violation, in which a database is coupled with a rule-based system including the knowledge about the integrity constraints. The rule-database verification system suggested accepts the model descriptions of an application domain, generates the knowledge base consisting of rules and facts by analyzing the model description and proceeds the verification process to check the integrity of the database.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.289-293
• /
• 2009

Patent information has a great value of industrial information as well as technical information. However, Korean patent information loses the effectiveness by the lack of description rule and requires much additional efforts to use them in variety. In this paper, some examples of the studies on the problems in databases were introduced and patent application(from Jan. 2008 to Oct. 2008) data retrieved from information service system of KISTI(Korea Institute of Science and Technology Information) and KIPI(Korea Institute of Patent Information) was surveyed.