• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.5
• /
• pp.725-729
• /
• 2009

In this paper, we introduce the concepts of intuitionistic fuzzy generalized topological spaces and intuitionistic gradation of generalized openness. We also introduce the concepts of IFG-mapping, weak IFG-mapping and IFG-open mapping, and obtain some characterizations for such mappings.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.447-449
• /
• 2012

There are many essential elements in making the realistic 3D games, of which one of the most important is mapping. Mapping can add the details to 3D objects easily, which are impossible or difficult by modeling alone, and can reduce file data capacities to run the game engine. The theory of the mapping is to throw 2D image on 3D object correctly, but they do not match each other at the rate of 1:1 100 percent completely due to the difference of the fundamental property of them. To solve this problem, various kinds of mapping methods are developed and used. This paper will compare and analyze the characteristics, and merits and demerits of these various kinds of mapping methods and will inquire which method is the most efficient one.

• The Pure and Applied Mathematics
• /
• v.16 no.4
• /
• pp.383-404
• /
• 2009

The notions of P-I-open (closed) mappings, P-I-continuous mappings, P-I-neighborhoods, P-I-irresolute mappings and I-irresolute mappings are introduced. Relations between P-I-open (closed) mappings and I-open (closed) mappings are given. Characterizations of P-I-open (closed) mappings are provided. Relations between a P-I-continuous mapping and an I-continuous mapping are discussed, and characterizations of a P-I-continuous mapping are considered. Conditions for a mapping to be an I-irresolute mapping (resp. P-I-irresolute mapping) are provided.

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

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.10
• /
• pp.3135-3141
• /
• 1996

In order to develop an efficient algorithm for S-to-M mapping in CMCA, characteristics of CMCA mappings is studied and conceptual mapping procedure is physically described. Then, careful observations on the mapping procedure and experience reveal a simple algorithm of the S-to-M mapping. The algorithm is described and compared with other procedures for S-to-M mapping. It is found very efficient in terms of computational operations and processing time.

• ETRI Journal
• /
• v.20 no.4
• /
• pp.327-345
• /
• 1998

This paper deals with the problem of one-to-one mapping of 2$^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize the total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. First we show that the mapping problem in a hypercube multicomputer can be transformed into the problem of finding a set of maximum cutsets on a given task graph using a graph modification technique. Then we propose a repeated mapping scheme, using an existing graph bipartitioning algorithm, for the effective mapping of task modules onto the processors of a hypercube multicomputer. The repeated mapping scheme is shown to be highly effective on a number of test task graphs; it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increases. Our repeated mapping scheme is shown to be very effective for regular graphs, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mappings on almost all the regular task graphs considered.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.5 s.182
• /
• pp.30-36
• /
• 2006

The participants in collaborative environment want to get the right information or documents which are intended to find. In general search systems, documents which contain only the keywords are retrieved. For searching different word-expressions for the same meaning, we perform mapping before searching. Our mapping-based search approach has two parts, ontology-based mapping logic and ontology libraries. The ontology-based mapping consists of three steps such as character matching (CM), definition comparing (DC) and similarity checking (SC). First, the character matching is the mapping of two terminologies that have identical character strings. Second, the definition comparing is the method that compares two terminologies' ontological definitions. Third, the similarity checking pairs two terminologies which were not mapped by two prior steps through evaluating the similarity of the ontological definitions. For the ontology libraries, document ontology library (DOL), keyword ontology library (KOL), and mapping result library (MRL) are defined. With these three libraries and three mapping steps, an ontology-based search engine (OntSE) is built, and a use case scenario is discussed to show the applicability.

• Child Studies in Asia-Pacific Contexts
• /
• v.6 no.2
• /
• pp.73-85
• /
• 2016

Speech-print mapping awareness is defined as the awareness of the principles underpinning how speech sound is matched to print symbols. Chinese is unique in that it follows the one syllable one character mapping principle. The present study examined the predictive power of speech-print mapping awareness in young children's word reading. Seventy-four Hong Kong children from the first and second kindergarten years were tested with phonological awareness, visual skills, syllable-level mapping awareness, and Chinese reading ability at Time 1. Chinese reading abilities were tested again 1 year later. It was found that syllable-level mapping awareness predicted Chinese word reading abilities 12 months later. Further, it seemed that the link of syllable mapping to Chinese reading is particularly significant for beginning readers. The findings suggest that understanding the language-specific speech-print mapping principle is critical for reading acquisition at the early stage of reading development.

• The Pure and Applied Mathematics
• /
• v.10 no.3
• /
• pp.185-192
• /
• 2003

It is shown that every almost linear mapping $h{\;}:{\;}X{\;}{\rightarrow}{\;}Y$ of a complex normed space X to a complex normed space Y is a linen. mapping when h(rx) = rh(x) (r > 0,$r\;{\neq}\;1$$x{\;}{\in}{\;}X$, that every almost quadratic mapping $h{\;}:{\;}X{\;}{\rightarrow}{\;}Y$ of a complex normed space X to a complex normed space Y is a quadratic mapping when $h(rx){\;}={\;}r^2h(x){\;}(r{\;}>{\;}0,r\;{\neq}\;1)$ holds for all $x{\;}{\in}{\;}X$, and that every almost cubic mapping $h{\;}:{\;}X{\;}{\rightarrow}{\;}Y$ of a complex normed space X to a complex normed space Y is a cubic mapping when $h(rx){\;}={\;}r^3h(x){\;}(r{\;}>{\;}0,r\;{\neq}\;1)$ holds for all $x{\;}{\in}{\;}X$.

• Journal of Astronomy and Space Sciences
• /
• v.27 no.1
• /
• pp.21-30
• /
• 2010

In processing space geodetic data, mapping functions are used to convert the tropospheric signal delay along the zenith direction to the line of sight direction. In this study, we compared three mapping functions by evaluating their effects on the tropospheric signal delay and position estimates in GPS data processing. The three mapping functions tested are Niell Mapping Function (NMF), Vienna Mapping Function 1 (VMF1), and Global Mapping Function (GMF). The tropospheric delay and height estimates from VMF1 and GMF are compared with the ones obtained with NMF. The differences among mapping functions show annual signals with the maximum occurring in February or August. To quantitatively estimate the discrepancies among mapping functions, we calculated the maximum difference and the amplitude using a curve fitting technique. Both the maximum difference and amplitude have high correlations with the latitude of the site. Also, the smallest difference was found around $30^{\circ}N$ and the amplitudes increase toward higher latitudes. In the height estimates, the choice of mapping function did not significantly affect the vertical velocity estimate, and the precision of height estimates was improved at most of the sites when VMF1 or GMF was used instead of NMF.