• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.317-320
• /
• 2004

디스플레이 장치간의 색 재현 차이를 극복하기 위하여 다양한 색역폭 사상 기법이 사용되고 있다. 기존 색역폭 사상 방법은 일반적으로 색 공간 변환과 같은 복잡한 비선형 변환을 여러 단계 거치므로 실시간 처리 구현이 어렵다. 본 논문에서는 신경 회로망을 이용하여 기존의 색역폭 사상 방법을 학습하고 근사화한 방법을 이용한다. 이를 위해 주어진 디스플레이 장치의 표현 가능한 모든 색상에 대해 미리 색역폭 사상을 수행하고 그 결과를 학습 데이터로 이용하게 되며, 학습된 신경망은 이종 디스플레이 장치간의 색역폭 사상에 사용된다. 제안된 색역사상을 실시간 처리하기 위해서 학습 과정은 오프라인을 통해서 이루어지게 되고, 구해진 신경망은 프로세서의 메모리를 이용, 1차원의 Look-Up Table로 구성한다. 제안한 방법을 색역폭 사상에 적절하도록 최적화시키면 고속의 색역폭 사상이 가능하다.

• The Journal of Information Systems
• /
• v.18 no.3
• /
• pp.327-349
• /
• 2009

Traditional keyword-based searching methods suffer from low accuracy and high complexity due to the rapid growth in the amount of information. Accordingly, many researchers attempt to implement a so-called semantic search which is based on the semantics of the user's query. Semantic information can be described using a semantic modeling language, such as Topic Map. In this paper, we propose a new method to map a topic map to a traditional Relational Database (RDB) without any information loss. Although there have been a few attempts to map topic maps to RDB, they have paid scant attention to handling multi-role topics. In this paper, we propose a new storage structure to map multi-role topics to traditional RDB. The proposed structure consists of a mapping table, role tables, and content tables. Additionally, we devise a query translator to convert a user's query to one appropriate to the proposed structure.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.349-350
• /
• 2008

Average throughput estimation of EV-DO forward link is implemented on the basis of the serving coverage area per sector instead of time consuming and complicated Monte Carlo simulation. For the implementation of this analysis function in cell planning tool, $CellTREK^{(R)}$, developed by KT, both SNR vs. DRC mapping table and receiver sensitivity are suggested as the satisfying criteria to be satisfied above each threshold level simultaneously.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.653-662
• /
• 1989

Cerebellar Model Arithmetic Controller (CMAC) has been introduced as an adaptive control function generator. CMAC computes control functions referring to a distributed memory table storing functional values rather than by solving equations analytically or numerically. CMAC has a unique mapping structure as a coarse coding and supervisory delta-rule learning property. In this paper, learning aspects and a convergence of the CMAC were investigated. The efficient training algorithms were developed to overcome the limitations caused by the conventional maximum error correction training and to eliminate the accumulated learning error caused by a sequential node training. A nonlinear function generator and a motion generator for a two d.o.f. manipulator were simulated. The efficiency of the various learning algorithms was demonstrated through the cpu time used and the convergence of the rms and maximum errors accumulated during a learning process. A generalization property and a learning effect due to the various gains were simulated. A uniform quantizing method was applied to cope with various ranges of input variables efficiently.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.177-181
• /
• 1996

Systematic classification system for standardization in telecommunication is essential to the standardization R&D strategy. This paper suggests a new reference model for development of work area and classification scheme related to the telecommunications standardization : Cubic and matrix approach. Standardization Work Areas(SWAs) that are upper level of the reference model are classified by its main role and function reflecting the market trends and user needs. Standardization expertise is lower level scheme, which can be regarded as the different possible layers of standardization to be applied to each one of the SWAs grouped under upper level scheme. A new reference model consists of two planes that are SWAs plane and Standardization layer plane. Finally the reference model for classification of SWAs in telecommunication mapping onto matrix table that row and column are defined by SWAs and standardization layer respectively.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.398-401
• /
• 2008

With the advance of internet and computer processing technique, users can easily access and use the multimedia contents involving the various pictures, videos and audios information. And users request more convenient and accurate multimedia services. In these environments, it is difficulties to integrate and manage metadata standards because there are various standards in multimedia applications according to types of services and data formats individually. In this paper, we design and implement the multimedia metadata management system for integrating from heterogeneous sources. In our system, we managed heterogeneous metadata by integrating to unified schema using mapping table. Through proposed system, users can search multimedia data easily without considering variety of application services.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.234-237
• /
• 2016

Address Resolution Protocol (ARP) is used for mapping a network address to physical address in many network technologies. However, since ARP protocol has no security feature, it always abused by attackers for performing ARP-based attacks. Researchers presented many technologies to improve ARP protocol, but most of them require a high implementation cost or scarify the network performance for using ARP protocol securely. In this paper, we present an ARP-disabled network system to neutralize the ARP-based attacks. "ARP-disabled" means suppress the ARP messages like request, response and broadcast messages, but not the ARP table. In our system, ARP tables are used for managing static ARP entries without prior knowledge (e.g. IP, MAC list of client devices). This is possible because the MAC address was designed to be derived from IP address. In general, our system is safe from the ARP-based attacks even the attacker has a strong power. Moreover, we saved network bandwidth by disabling the ARP messages.

• 한국기계연구소 소보
• /
• s.19
• /
• pp.93-115
• /
• 1989

Cerebellar Model Arithmetic Controller(CMAC) has been introduced as an adaptive control function generator. CMAC computes control functions referring to a distributed memory table storing functional values rather than by solving equations analytically or numerically. CMAC has a unique mapping structure as a coarse coding and supervisory delta-rule learning property. In this paper, learning aspects and a convergence of the CMAC were investigated. The efficient training algorithms were developed to overcome the limitations caused by the conventional maximum error correction training and to eliminate the accumulated learning error caused by a sequential node training. A nonlinear function generator and a motion generator for a two d. o. f. manipulator were simulated. The efficiency of the various learning algorithms was demonstrated through the cpu time used and the convergence of the rms and maximum errors accumulated during a learning process; A generalization property and a learning effect due to the various gains were simulated. A uniform quantizing method was applied to cope with various ranges of input variables efficiently.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.550-552
• /
• 2004

분산 해시 테이블 (Distributed Hash Table) 을 사용한 P2P 시스템에서는 해시함수를 사용하며 파일과 노드의 ID를 정의하고 파일의 ID와 매핑 (mapping) 되는 ID를 가진 노드에 파일을 저장함으로써 시스템 전체에 파일을 완전히 분산시킨다. 이러한 시스템에서는 파일을 찾을 때 해시된 파일 ID로 찾기 때문에 정확한 매치 (exact match) 만 가능하다. 하지만 현재 P2P 파일 공유 시스템에서는 파일의 전체 이름을 정확히 알지 못하더라도 부분적인 키워드로 파일을 검색할 수 있도록 하는 키워드 검색 (keyword search) 이 요구된다. 본 논문에서는 분산 해시 테이블을 기반으로 하는 P2P 시스템에서 키워드 검색이 가능하도록 하는 방안을 제안한다.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.374-381
• /
• 2011

A simple and effective compression method is proposed for multiple-scan testing. For a given test set, each test pattern is compressed from the view of slices. An encoding table exploiting seven types of frequently-occurring pattern is used. Compression is then achieved by mapping slice data into codewords. The decompression logic is small and easy to implement. It is also applicable to schemes adopting a single-scan chain. Experimental results show this method can achieve good compression effect.