• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.185-191
• /
• 1999

Mathematical morphology based on set theory has been applied to various areas in image processing. Pitas proposed a object recognition algorithm using Morphological Shape Decomposition(MSD), and a new representation scheme called Morphological Shape Representation(MSR). The Pitas's algorithm is a simple and adequate approach to recognize objects that are rotated 45 degree-units with respect to the model object. However, this recognition scheme fails in case of random rotation. This disadvantage may be compensated by defining small angle increments. However, this solution may greatly increase computational complexity because the smaller the step makes more number of rotations to be necessary. In this paper, we propose a new method for object recognition based on MSD. The first step of our method decomposes a binary shape into a union of simple binary shapes, and then a new tree structure is constructed which ran represent the relations of binary shapes in an object. finally, we obtain the feature informations invariant to the rotation, translation, and scaling from the tree and calculate matching scores using efficient matching measure. Because our method does not need to rotate the object to be tested, it could be more efficient than Pitas's one. MSR has an intricate structure so that it might be difficult to calculate matching scores even for a little complex object. But our tree has simpler structure than MSR, and easier to calculated the matchng score. We experimented 20 test images scaled, rotated, and translated versions of five kinds of automobile images. The simulation result using octagonal structure elements shows 95% correct recognition rate. The experimental results using approximated circular structure elements are examined. Also, the effect of noise on MSR scheme is considered.

• Annual Conference of KIPS
• /
• 2009.11a
• /
• pp.13-14
• /
• 2009

Intermediate Representation(IR)은 컴파일러가 Target code 를 생성하기까지의 중간 단계에서 프로그램을 표현하는 수단이다. 본 논문에서는 컴파일러의 IR을 직접 Simulation 해서 각종 profiling information을 수집하여 프로그램의 성능 향상에 도움을 줄 수 있는 IR Simulator를 제안하고자 한다. 더 나아가 IR Simulator를 위한 Data structure와 Interface는 Target Simulation에도 재사용이 가능하도록 고안되었기 때문에 재겨냥성 컴파일러의 Target Simulator를 자동으로 생성하는 연구를 진행하고 있다.

• Language and Information
• /
• v.20 no.1
• /
• pp.25-49
• /
• 2016

Honorific forms express the speaker's social attitude to others and also indicate the social ranks and level of intimacy of the participants in the discourse. In a cross-linguistic perspective of grammar engineering, modelling honorification has been regarded as a key strategy for improving language processing applications. Using the HPSG and MRS formalism, this article provides a multilingual grammar model of honorification. The present study incorporates the honorific information into the Meaning Representation System (MRS) via Individual Constraints (ICONS), and then conducts an evaluation to see if the model contributes to semantics-based language processing.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.25 no.5
• /
• pp.765-772
• /
• 2011

Knowledge which is represented by formal logic are widely used in many domains such like artificial intelligence, information retrieval, e-commerce and so on. And for medical field, medical documentary records retrieval, information systems in hospitals, medical data sharing, remote treatment and expert systems need knowledge representation technology. To retrieve information intellectually and provide advanced information services, systematically controlled mechanism is needed to represent and share knowledge. Importantly, medical expert's knowledge should be represented in a form that is understandable to computers and also to humans to be applied to the medical information system supporting decision making. And it should have a suitable and efficient structure for its own purposes including reasoning, extendability of knowledge, management of data, accuracy of expressions, diversity, and so on. we call it ontology which can be processed with machines. We can use the ontology to represent traditional medicine knowledge in structured and systematic way with visualization, then also it can also be used education materials. Hence, the authors developed an Shanghanlun ontology by way of showing an example, so that we suggested a methodology for ontology development and also a model to structure the traditional medical knowledge. And this result can be used for student to learn Shanghanlun by graphical representation of it's knowledge. We analyzed the text of Shanghanlun to construct relational database including it's original text, symptoms and herb formulars. And then we classified the terms following some criterion, confirmed the structure of the ontology to describe semantic relations between the terms, especially we developed the ontology considering visual representation. The ontology developed in this study provides database showing fomulas, herbs, symptoms, the name of diseases and the text written in Shanghanlun. It's easy to retrieve contents by their semantic relations so that it is convenient to search knowledge of Shanghanlun and to learn it. It can display the related concepts by searching terms and provides expanded information with a simple click. It has some limitations such as standardization problems, short coverage of pattern(證), and error in chinese characters input. But we believe this research can be used for basic foundation to make traditional medicine more structural and systematic, to develop application softwares, and also to applied it in Shanghanlun educations.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.145-152
• /
• 2010

In this paper, we first propose a fast division algorithm in GF($2^{163}$) using standard basis representation, and then it is mapped into divider for GF($2^{163}$) with iterative hardware structure. The proposed algorithm is based on the binary ExtendedGCD algorithm, and the arithmetic operations for modular reduction are performed within only one "while-statement" unlike conventional approach which uses two "while-statement". In this paper, we use reduction polynomial $f(x)=x^{163}+x^7+x^6+x^3+1$ that is recommended in SEC2(Standards for Efficient Cryptography) using standard basis representation, where degree m = 163. We also have implemented the proposed iterative architecture in FPGA using Verilog HDL, and it operates at a clock frequency of 85 MHz on Xilinx-VirtexII XC2V8000 FPGA device. From implementation results, we will show that computation speed of the proposed scheme is significantly improved than the existing two approaches.

• 한국디지털정책학회:학술대회논문집
• /
• 2005.11a
• /
• pp.383-389
• /
• 2005

The purpose of this paper is to develop the metadata on the information of research result in Science and technology and to design the domain knowledge structure using semantic web technology for further implementation. In this paper, we first analyze the existing theories and techniques related to the metadata in such fields as R&D research result, international standard, and semantic web. Then, we extract and group the relevant factors from Dublin Core, CERIF, and the research results for building the integrated metadata framework. Based on our proposed metadata, we design a domain knowledge structure which employs RDF/RDFS as knowledge representation tool. Therefore, we can implement the ontology which produce the 'intelligent' information service and improve the interoperability between the research institutions. Also, the metadata can be used as the basis for developing National R&D Performance Information, and in terms of research institutions, can be used as tools for managing the their own research results information systematically and consistently.

• Journal of Korean Library and Information Science Society
• /
• v.39 no.4
• /
• pp.283-304
• /
• 2008

This is to develop Intelligent Retrieval System which can automatically present early query's category terms(association terms connected with knowledge structure of relevant terminology) through learning function and it changes searching form automatically and runs it with association terms. For the reason, this theoretical study of Intelligent Automatic Indexing System abstracts expert's index term through learning and clustering algorism about automatic classification, text mining(categorization), and document category representation. It also demonstrates a good capacity in the aspects of expense, time, recall ratio, and precision ratio.

• Korean Journal of English Language and Linguistics
• /
• v.4 no.1
• /
• pp.1-31
• /
• 2004

This paper has revisited the dative alternation in English, and defended the so-called polysemy view. The paper has argued for a particular format of lexical representation, one that allows reference to events. In addition to the semantic conditions, the paper has argued that the DO and PO constructions also allow for different information structures.

• Annual Conference of KIPS
• /
• 2002.04a
• /
• pp.523-526
• /
• 2002

본 논문은 한국어대화에는 주어나 목적어와 같은 구성요소의 빈번한 생략, 존대현상, 존대대명사의 사용 등의 특이한 현상이 나타나는 것을 지적하고, 이러한 한국어대화를 처리하기 위해서는 대화참석자에 관한 정보, 발화문의 화행에 관한 정보, 대화에 관련된 사람들의 사회적 지위에 있어서의 상대적 순위에 관한 정보 등의 상황정보와 정보의 흐름을 이용해야만 한다고 주장한다. 또한, 본 논문은 이러한 상황정보를 전산적으로 어떻게 표기해서 입력하고 한국어대화의 표상구조를 어떠한 형태로 구축하는 것이 타당한지도 자세히 보여 준다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.805-807
• /
• 2003

현재 생물분자의 기능적 관점에서 단백질 구조에 관심이 많이 모아지고 있다. 단백질의 기능은 구조에서 기인하기 때문에 두 단백질의 구조간의 유사성을 측정할 수 있는 방법은 두 단백질의 기능의 유사성을 유추할 수 있다. 본 논문에서는 두 단백질의 구조의 유사성을 측정하기 위한 단백질의 새로운 표현(representation)으로 3차원 에지 히스토그램을 제안한다. 단백질의 3차원 구조를 작은 복셀(voxel)로 이루어진 공간으로 나누고 복셀들로부터 3차원 에지 히스토그램을 추출하여 두 단백질간의 유사도 계산에 이용한다. 이를 통하여 단백질의 검색 및 분류를 시도한다.