• Title/Summary/Keyword: 간접 매핑

Search Result 8, Processing Time 0.027 seconds

Mapping between CoreNet and SUMO through WordNet (WordNet을 매개로 한 CoreNet-SUMO의 매핑)

  • Kang, Sin-Jae;Kang, In-Su;Nam, Se-Jin;Choi, Key-Sun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.2
    • /
    • pp.276-282
    • /
    • 2011
  • CoreNet is a valuable resource to use in the domain of natural language processing including Korean-Chinese-Japanese multilingual text analysis, and translation among natural languages. CoreNet is mapped to SUMO in order to encourage its application in broader fields and enhance its international status as a multilingual lexical semantic network. To do this, indirect and direct mapping methodologies are used. Through the indirect mapping among CoreNet-KorLex-PWN-SUMO, we alleviate the difficulty of translating CoreNet concept terms in Korean into SUMO concepts in English, and maximize recall of SUMO concepts corresponding to the concept of CoreNet.

Direct Mapping based Binary Translation Rule Generator with Considering Retargetability (재목적성을 고려한 직접 매핑 기반의 이진 변환 규칙 생성 도구)

  • Seo, Yongjin;Kim, Hyeon Soo
    • Journal of KIISE:Software and Applications
    • /
    • v.41 no.7
    • /
    • pp.501-517
    • /
    • 2014
  • Binary translation is a restructuring process in order to execute a program targeting a specific device on the other devices. In binary translation, it is very important to generate the translation rules between two devices. There are two methods for generating the translation rules, direct and indirect mapping. The direct mapping is the method for performance, while the indirect mapping is the method for retargetability. This paper suggests a binary translation method based on the direct mapping for the embedded systems. Because, however, the retargetability is also important requirement, we suggest the direct mapping based binary translation with considering the retargetability. In addition, we implement an automatic generation tool for translation rules to prove our concept. Through this method, we can generate the translation rules with considering the performance as well as the retargetability. Furthermore, we can reduce costs for the binary translation.

Ontology Mapping Composition for Query Transformation on Distributed Environments (분산 환경에서의 쿼리 변환을 위한 온톨로지 매핑 결합)

  • Jung, Jason J.
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.4
    • /
    • pp.19-30
    • /
    • 2008
  • Semantic heterogeneity should be overcome to support automated information sharing process between information systems in ontology-based distributed environments. To do so, traditional approaches have been based on explicit mapping between ontologies from human experts of the domain. However, the manual tasks are very expensive, so that it is difficult to obtain ontology mappings between all possible pairs of information systems. Thereby, in this paper, we propose a system to make the existing mapping information sharable and exchangeable. It means that the proposed system can collect the existing mapping information and aggregate them. Consequently, we can estimate the ontology mappings in an indirect manner. In particular, this paper focuses on query propagation on the distributed networks. Once we have the indirect mapping between systems, the queries can be efficiently transformed to automatically exchange knowledge between heterogeneous information systems.

  • PDF

Linking OntoCloud to WordNet (OntoCloud와 워드넷 연결)

  • Park, Kwang-Hee;Kim, Eun-Kyung;Choi, DongHyun;Choi, Key-Sun
    • Annual Conference on Human and Language Technology
    • /
    • 2010.10a
    • /
    • pp.172-176
    • /
    • 2010
  • 본 논문에서는 위키피디아의 '틀(temp late)'을 기조로 하여 작성된 온톨로지인 OntoCloud의 신뢰도를 보장하고 공유 및 재사용을 가능하게 하기 위하여 또 다른 어휘집합체인 워드넷(WordNet)과의 매핑을 한다. 온톨로지 매핑 기술은 온톨로지 개발 기술의 한 방법으로, 서로 비슷한 도메인을 대상으로 이미 구축되어진 서로 다른 다수의 온롤로지를 연결시킴으로서 하나의 풍부한 정보를 가지고 있는 연결망을 구축하는 방법이다. 본 논문에서는 OntoCloud와 워드넷을 두개의 온톨로지로 정의하고 각 온톨로지의 개념에 대한 정의문 비교 방법을 통해서 두개의 온톨로지에 존재하는 유사한 개념을 연결한다. 이렇게 매핑된 정보들은 OntoCloud 개념을 워드넷 어휘로 연결함으로써 개념에 대한 직관적인 이해를 돕고, 워드넷에 연결된 다른 시소러스 (예: SUMO, CoreNet 등)와 간접적으로 연결할 수 있는 틀을 마련한다. 또한 온톨로지의 상하위 계층정보를 자동으로 보강하는 등의 OntoCloud 유지보수에 활용될 수 있다. 본 논문의 실험에서는 두개의 서로 다른 온톨로지의 정의문에 사용된 어휘의 겹침 정도로 두개의 개념의 유사성을 판별하는 방법을 보인다. 본 논문에서 제시한 방법으로 약 73%의 개념 매핑에 성공하였으나, 추후 매핑 프로세스의 전처리 과정(약자 처리 및 복합명사 대응 모듈)을 추가하고 온톨로지의 구조적 특성을 활용하여 유사 개념 자동 매핑 기술을 향상시키고자 한다.

  • PDF

Analysis of Harmonic Mean Distance Calculation in Global Illumination Algorithms (전역 조명 알고리즘에서의 조화 평균 거리 계산의 분석)

  • Cha, Deuk-Hyun;Ihm, In-Sung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.2
    • /
    • pp.186-200
    • /
    • 2010
  • In order to render global illumination realistically, we need to accurately compute the direct and indirect illumination that represents the light information incoming through complex light paths. In this process, the indirect illumination at given point is greatly affected by surrounding geometries. Harmonic mean distance is a mathematical tool which is often used as a metric indicating the distance from a surface point to its visible objects in 3D space, and plays a key role in such advanced global illumination algorithms as irradiance/radiance caching and ambient occlusion. In this paper, we analyze the accuracy of harmonic mean distance estimated against various environments in the final gathering and photon mapping methods. Based on the experimental results, we discuss our experiences and future directions that may help develop an effective harmonic mean distance computation method in the future.

A New Mapping Algorithm for Depth Perception in 3D Screen and Its Implementation (3차원 영상의 깊이 인식에 대한 매핑 알고리즘 구현)

  • Ham, Woon-Chul;Kim, Seung-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.6
    • /
    • pp.95-101
    • /
    • 2008
  • In this paper, we present a new smoothing algorithm for variable depth mapping for real time stereoscopic image for 3D display. Proposed algorithm is based on the physical concept, called Laplacian equation and we also discuss the mapping of the depth from scene to displayed image. The approach to solve the problem in stereoscopic image which we adopt in this paper is similar to multi-region algorithm which was proposed by N.Holliman. The main difference thing in our algorithm compared with the N.Holliman's multi-region algorithm is that we use the Laplacian equation by considering the distance between viewer and object. We implement the real time stereoscopic image generation method for OpenGL on the circular polarized LCD screen to demonstrate its real functioning in the visual sensory system in human brain. Even though we make and use artificial objects by using OpenGL to simulate the proposed algorithm we assure that this technology may be applied to stereoscopic camera system not only for personal computer system but also for public broad cast system.

Scalable and Robust Data Dissemination Scheme for Large-Scale Wireless Sensor Networks (대규모 무선 센서 네트워크를 위한 확장성과 강건성이 있는 데이터 전송 방안)

  • Park, Soo-Chang;Lee, Eui-Sin;Park, Ho-Sung;Lee, Jeong-Cheol;Oh, Seung-Min;Jung, Ju-Hyun;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1359-1370
    • /
    • 2009
  • In wireless sensor networks, data dissemination is based on data-centric routing that well matches the publish/subscribe communication paradigm. The publish/subscribe paradigm requires decoupling properties: space, time, and synchronization decoupling. For large-scale applications, the three decoupling properties provide scalability and robust communication. However, existing data dissemination schemes for wireless sensor networks do not achieve full decoupling. Therefore, we propose a novel data dissemination scheme that fully accomplishes the three decoupling, called ARBIETER. ARBITER constructs an independent network structure as a logical software bus. Information interworking between publishers and subscribers is indirectly and asynchronously performed via the network structure. ARBITER also manages storage and mapping of queries and data on the structure because of supporting different time connection of publishers and subscribers. Our simulation proves ARBITER show better performance in terms of scalability, network robustness, data responsibility, mobility support, and energy efficiency.

Analyzing Korean Media Industry Trends and Competitive Strategies by Introducing Comprehensive Programming Channels (종합편성채널 도입에 따른 국내 미디어산업 변화 및 사업자 경쟁방안에 관한 연구)

  • Cho, Ji-Yeon;Song, Ju-Ho;Lee, Bong-Gyou
    • Journal of Internet Computing and Services
    • /
    • v.12 no.1
    • /
    • pp.39-53
    • /
    • 2011
  • Recently, a new media reform bill has passed through the National Assembly in Korea. The introduction of comprehensive programming channels that combine news and entertainment programs is expected to have a direct and indirect effect on the media related industry. And it affects not only existing traditional media operators, but also companies that consider entering the comprehensive programming business. This study analyzes the changes caused by the emergence of new businesses and identifies competitive strategies. Using Scenario Network Mapping (SNM) that is a scenario planning methodology for developing an industry network map in a complex environment. As a result of this study, the following competitive factors were identified: new business competitiveness, government policy and support, and content differentiation. This study has significance as an initial study on comprehensive programming channels strategies. It also provides implications to the government and the entrepreneur who is considering starting a comprehensive programming business.