• Journal of the Korean Society for information Management
• /
• v.24 no.4
• /
• pp.223-238
• /
• 2007

This paper contains an analysis of the methods that have been used to achieve or improve interoperability among metadata and discuss the possibilities and limits of semantic interoperability among metadata using crosswalk. After that a semantic metadata mapping process which is able to maximize the interoperability among metadata is suggested. The methodology consists of four steps such as identifying metadata schema, finding common data element concepts(DECs), grouping attributes by the DECs, and mapping into a table. An experimental application of the process was performed onto two human resource information metadata standards developed in Korea.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.535-546
• /
• 2002

According as the users can connect to remote hosts at anytime by using internet, the demand of non-stop system is increased. Also, the research about on-line adding/deleting disks and hosts are progressed. This paper suggests that the method of reducing additional operation when we add disks to the stripping system. That method can fast mapping like equation based mapping method because of using so-called SZIT(Striping Zone Information Table) and equations. And that method can reduce the relocation overhead in striping system at adding disks.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.99-113
• /
• 2004

A new architecture called SAN(Storage Area Network) was developed in response to the requirements of high availability of data, scalable growth, and system performance. In order to use SAN more efficiently, most of SAN operating softwares support storage virtualization concepts that allow users to view physical storage devices attached to SAN as a large volume virtually h logical volume manager plays a key role in storage virtualization. It realizes the storage virtualization by mapping logical addresses to physical addresses. A logical volume manager also supports a snapshot that preserves a volume image at certain time and on-line reorganization to allow users to add/remove storage devices to/from SAN even while the system is running. To support the snapshot and the on-line reorganization, most logical volume managers have used table based mapping methods. However, it is very difficult to manage mapping table because the mapping table is large in proportion to a storage capacity. In this paper, we design and implement an efficient and flexible hybrid mapping method based on mathematical equations. The mapping method in this paper supports a snapshot and on-line reorganization. The proposed snapshot and on-line reorganization are performed on the reserved area which is separated from data area of a volume. Due to this strategy normal I/O operations are not affected by snapshot and reorganization. Finally, we show the superiority of our proposed mapping method through various experiments.

• Journal of Digital Contents Society
• /
• v.11 no.1
• /
• pp.91-97
• /
• 2010

Flash memory has been used by many digital devices for data storage, exploiting the advantages of non-volatility, low power, stability, and so on, with the help of high integrity, large capacity, and low price. As the fast growing popularity of flash memory, the density of it increases so significantly that its entire address mapping table becomes too big to be stored in SRAM. This paper proposes the associated page address cache with an efficient table management scheme for hybrid flash translation layer mapping. For this purpose, all tables are integrated into a map block containing entire physical page tables. Simulation results show that the proposed scheme can save the extra memory areas and decrease the searching time with less 2.5% of miss ratio on PC workload and can decrease the write overhead by performing write operation 33% out of total writes requested.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2002.08a
• /
• pp.868-871
• /
• 2002

In this paper, we introduce an efficient three-dimensional magnetic field mapping system for a Deflection Yoke (DY) in Cathode-Ray Tube (CRT). A three-axis Hall probe mounted in a small cylindrical bar and three stepping motors placed in a nonmagnetic frame are utilized for the mapping. Prior to the mapping starts, the inner contour of DY is measured by a laser sensor to make a look-up table for inner shape of DY. Three-axis magnetic fields are then digitized by a three-dimensional Hall probe. The results of the mapping can be transformed to various output formats such as multipole harmonics of magnetic fields. Field shape in one, two and three-dimensional spaces can also be displayed. In this paper, we present the features of this mapping device and show some analysis results.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.4
• /
• pp.695-707
• /
• 2013

DHT(Distributed Hash Table) networks such as Kademlia are vulnerable to the ID mapping attack caused by the voluntary DHT mapping structure where the location of a node is solely determined by itself on the network topology. This causes security problems such as eclipse, DRDoS and botnet C&C on DHT networks. To prevent ID mapping attacks, we propose a non-voluntary DHT mapping scheme and perform analysis on NAT compatibility, attack resistance, and network dynamicity. Analysis results show that our approach may have an equivalent level of attack resistance comparing with other defense mechanisms and overcome their limitations including NAT compatibility and network dynamicity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.12-18
• /
• 2007

The three dimensional interpolation is widely used for many kinds of color signal transformation such as real-time color gamut mapping. Given input color signal, the output color signal is approximately calculated by the interpolation with the input point and extracted values from a lookup table which is constructed by storing the values of transformation at regularly packed sample points. Apparently, errors of the interpolated approximation heavily depend on the selection of the lookup table. In this paper, a least square method is applied to assigning values of the lookup table with fixed size in order to minimize error of three-dimensional interpolation. The experimental result shows that the proposed method has better interpolation performance.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.9
• /
• pp.335-344
• /
• 2018

The power model is needed to handle the power consumption of mobile AMOLED display at the software level. However, the existing studies to generate the power model have required the experimental environment and equipment for the power measurement activity. In addition, the combination of RGB values used for modeling was imprudent and small, so it was difficult to reflect the mutual influence between the RGB values into the model. To solve these problems, we propose an RGB color space partitioning method, which is used to prudently sample the combinations of the RGB values based on the color or the power. We also propose a process for generating a mapping table composed of . We analyzed the characteristics of the samples generated according to the proposed partitioning methods, taking into account the color and the power, and generated the mapping table for the AMOLED display. Furthermore, we confirmed the reusability of the mapping table by utilizing one mapping table multiple times in evaluating different power models. These mapping tables are provided to researchers and can be used to generate and evaluate power models without power measurement activities.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2867-2869
• /
• 2005

색역폭 사상은 디스플레이 장치간의 색재현성 차이를 보정하는 하나의 방법이다. 일반적으로 실시간 색역폭 사상은 3차원 Look-Up Table과 3차원 보간기로 구성되고 3차원 보간기의 성능은 3차원 Look-Up Table에 의해 결정된다. 본 논문에서는 실시간 색역 사상에 사용되는 3차원 Look-Up Table을 Least Square Method(최소자승법)를 이용하여 최적화하고자 한다. 시뮬레이션 결과 제안된 방법에 의해 생성된 Look-Up Table이 기존의 방법에 비해 우선된 색 재현 성능을 갖는다.

• MALSORI
• /
• no.52
• /
• pp.161-169
• /
• 2004

This paper describes the automated call routing for train ticket reservation aid system based on speech recognition. We focus on the task of automatically routing telephone calls based on user's fluently spoken response instead of touch tone menus in an interactive voice response system. Vector-based call routing algorithm is investigated and mapping table for key term is suggested. Korail database collected by KT is used for call routing experiment. We evaluate call-classification experiments for transcribed text from Korail database. In case of small training data, an average call routing error reduction rate of 14% is observed when mapping table is used.