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

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.41.5-41
• /
• 2001

A novel method is introduced for determining the weights of a regularization network which approximates one-to-many mapping. A conventional neural network will converges to the average value when outputs are multiple for one input. The capability of proposed network is demonstrated by an example of learning inverse mapping.

• 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 Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.181-189
• /
• 2005

Due to grammatical similarities, even a one-to-one mapping between Korean and Japanese morphemes can usually result in a high quality Korean-to-Japanese machine translation. So most of Korean-to-Japanese machine translation are based on a one-to-one mapping relation. Most of Korean '-hada' verbs, which consist of a noun and '-hada', also correspond to Japanese '-suru' verbs, which consist of a noun and '-suru', so we generally use one-to-one mapping relation between them. However, the applications only by one-to-one mapping may sometimes result in incorrect Japanese correspondences in some cases that Korean 'hada' verbs don't correspond to Japanese 'suru' verbs. In these cases, we need to handle a noun and '-hada' as one translation unit. Therefore, this paper examined the characteristics of Korean '-hada' verb and proposed transfer rules of Korean 'hada' verb, applying for various states of input sentences such as discontinuity due to inserted words between a noun and '-hada', passivization, and modification of '-hada' verb. In an experimental evaluation, the proposed method was very effective for handling '-hada' verb in a Korean-to-Japanese machine translation, showing high quality of translation results.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2823-2834
• /
• 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 to total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. We first propose a graph modification technique which transfers the mapping problem in a hypercube multicomputer into the problem of finding a set of maximum cutsets on a given task graph. Using the graph modification technique, we then propose a repeated mapping scheme which efficiently finds a one-to-one mapping of task modules to a hypercube multicomputer by repeatedly applying an existing bipartitioning algorithm on the modified graph. 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 increase. The proposed algorithm is shown to be very effective for regular graph, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mapping on almost all the regular task graphs considered.

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

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.7 no.4
• /
• pp.215-220
• /
• 2007

Leakage current of CMOS circuits has become a major factor in VLSI design these days. Although many circuit-level techniques have been developed, most of them require significant amount of designers' effort and are not aligned well with traditional VLSI design process. In this paper, we focus on technology mapping, which is one of the steps of logic synthesis when gates are selected from a particular library to implement a circuit. We take a radical approach to push the limit of technology mapping in its capability of suppressing leakage current: we use a probabilistic leakage (together with delay) as a cost function that drives the mapping; we consider pin reordering as one of options in the mapping; we increase the library size by employing gates with larger gate length; we employ a new flipflop that is specifically designed for low-leakage through selective increase of gate length. When all techniques are applied to several benchmark circuits, leakage saving of 46% on average is achieved with 45-nm predictive model, compared to the conventional technology mapping.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.7
• /
• pp.414-420
• /
• 2004

Among the desirable properties of a piecewise linear parameterization, guaranteeing a one-to-one mapping (i.e., no triangle flips in the parameter plane) is often sought. A one-to-one mapping is accomplished by non-negative coefficients in the affine transformation. In the Floater's method, the coefficients were computed after the 3D mesh was flattened by geodesic polar-mapping. But using this geodesic polar map introduces unnecessary local distortion. In this paper, a simple variant of the original shape-preserving mapping technique by Floater is introduced. A new simple method for calculating barycentric coordinates by using straightest geodesics is proposed. With this method, the non-negative coefficients are computed directly on the mesh, reducing the shape distortion introduced by the previously-used polar mapping. The parameterization is then found by solving a sparse linear system, and it provides a simple and visually-smooth piecewise linear mapping, without foldovers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1110-1115
• /
• 2014

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.15-23
• /
• 1996

Bump mapping is an elegant rendering technique to simulate wrinkled surfaces such as bark, which enables to produce more realistic image than texture-mapped one. This paper presents a new algorithm for bump mapping along with a hardware architecture to run our algorithm in real-time. The proposed approach is more efficient than previous one, and in particular, our hardware architecture is simpler to implement.