• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.6_2
• /
• pp.593-599
• /
• 2013

China's Mapping Satellite-1, developed by the China Aerospace Science and Technology Corporation (CASC), was launched in three years ago. The data from Mapping Satellite-1 are able to use for efficient surveying and geometric mapping application field. In this paper, we fuse the panchromatic and multispectral images of Changchun area, which are obtained from the Mapping Satellite-1, the one that is the Chinese first transmission-type three-dimensional mapping satellite. The four traditional image fusion methods, which are HPF, Mod.IHS, Panshar and wavelet transform, were used to approach for effectively fusing Mapping Satellite-1 remote sensing data. Subsequently we assess the results with some commonly used methods, which are known a subjective qualitative evaluation and quantitative statistical analysis approach. Consequently, we found that the wavelet transform remote sensing image fusion is the optimal in the degree of distortion, the ability of performance of details and image information availability among four methods. To further understand the optimal methods to fuse Mapping Satellite-1 images, an additional study is necessary.

• Journal of Information Display
• /
• v.3 no.4
• /
• pp.19-22
• /
• 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 non-magnetic frame were utilized for the mapping. Prior to the mapping starts, the inner contour of DY was 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 into various output formats such as multi pole 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 some analysis results.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.6
• /
• pp.634-646
• /
• 2015

Coarse-Grained Reconfigurable Architecture (CGRA) is a very promising platform that provides fast turn-around-time as well as very high energy efficiency for multimedia applications. One of the problems with CGRAs, however, is application mapping, which currently does not scale well with geometrically increasing numbers of cores. To mitigate the scalability problem, this paper discusses how to use the SIMD (Single Instruction Multiple Data) paradigm for CGRAs. While the idea of SIMD is not new, SIMD can complicate the mapping problem by adding an additional dimension of iteration mapping to the already complex problem of operation and data mapping, which are all interdependent, and can thus significantly affect performance through memory bank conflicts. In this paper, based on a new architecture called SIMD reconfigurable architecture, which allows SIMD execution at multiple levels of granularity, we present how to minimize bank conflicts considering all three related sub-problems, for various RA organizations. We also present data tiling and evaluate a conflict-free scheduling algorithm as a way to eliminate bank conflicts for a certain class of mapping problem.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.8
• /
• pp.9-17
• /
• 2019

In this paper, we propose a block mapping technique applicable to NAND flash memory. In order to use the NAND flash memory with the operating system and the file system developed on the basis of the hard disk which is mainly used in the general PC field, it is necessary to use the system software known as the FTL (Flash Translation Layer). FTL overcomes the disadvantage of not being able to overwrite data by using the address mapping table and solves the additional features caused by the physical structure of NAND flash memory. In this paper, we propose a new mapping method based on the block mapping method for efficient use of the NAND flash memory. In the case of the proposed technique, the data modification operation is processed by using a blank page in the existing block without using an additional block for the data modification operation, thereby minimizing the block unit deletion operation in the merging operation. Also, the frequency of occurrence of the sequential write request and random write request Accordingly, by optimally adjusting the ratio of pages for recording data in a block and pages for recording data requested for modification, it is possible to optimize sequential writing and random writing by maximizing the utilization of pages in a block.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.1-9
• /
• 2011

In this paper, we consider an iterative scheme for finding a common element of the set of fixed points of a asymptotically quasi nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly monotone mapping in a Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common fixed point of a asymptotically quasi-nonexpansive mapping and strictly pseudocontractive mapping and the problem of finding a common element of the set of fixed points of a asymptotically quasi-nonexpansive mapping and the set of zeros of an inverse-strongly monotone mapping.

• Journal of Korea Game Society
• /
• v.19 no.6
• /
• pp.49-60
• /
• 2019

Interior Mapping has been used to reduce graphics resources. In this paper, rendering speed(FPS), the number of polygons, shader complexity and each resource size of Interior Mapping were compared to those of actual modeling in order to examine the performance of 3D games when the technology is adapted by utilizing Unreal Engine 4. In addition, for the efficient application, the difference in performance according to the resolution and detail of cube map texture was verified.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.87-102
• /
• 2011

The purpose of this paper is to prove strong convergence theorems for finding a common element of the set of fixed points of a weak relatively nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping by a new hybrid method in a Banach space. We shall give an example which is weak relatively nonexpansive mapping but not relatively nonexpansive mapping in Banach space $l^2$. Our results improve and extend the corresponding results announced by Ying Liu[Ying Liu, Strong convergence theorem for relatively nonexpansive mapping and inverse-strongly-monotone mapping in a Banach space, Appl. Math. Mech. -Engl. Ed. 30(7)(2009), 925-932] and some others.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.293-309
• /
• 2011

The purpose of this article is to prove strong convergence theorems for weak relatively nonexpansive mapping which is firstly presented in this article. In order to get the strong convergence theorems for weak relatively nonexpansive mapping, the monotone CQ iteration method is presented and is used to approximate the fixed point of weak relatively nonexpansive mapping, therefore this article apply above results to prove the strong convergence theorems of zero point for maximal monotone operators in Banach spaces. Noting that, the CQ iteration method can be used for relatively nonexpansive mapping but it can not be used for weak relatively nonexpansive mapping. However, the monotone CQ method can be used for weak relatively nonexpansive mapping. The results of this paper modify and improve the results of S.Matsushita and W.Takahashi, and some others.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.181-186
• /
• 2005

In collaborative environment, it is necessary that the participants in collaboration should share the same understanding about the semantics of terms. For example, they should know that 'Part' and 'Item' are different word-expressions for the same meaning. In this paper, we consider sharing between CAD and PDM data. In order to handle such problems in information sharing, an information system needs to automatically recognize that the terms have the same semantics. Serving this purpose, the semantic mapping logic and the ontology based mapper system is described in this paper. In the semantic mapping logic topic, we introduce our logic that consists of four modules: Character Matching, Instance Reasoning, definition comparing and Similarity Checking. In the ontology based mapper, we introduce the system architecture and the mapping procedure.