• ETRI Journal
• /
• 제20권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.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제10권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$.

• 대한기계학회논문집A
• /
• 제20권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.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제16권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.

• East Asian mathematical journal
• /
• 제30권1호
• /
• pp.69-77
• /
• 2014

In this paper, we introduce a new generalized resolvent in a Banach space and discuss its some properties. Using these properties, we obtain an iterative scheme for finding a point which is a fixed point of relatively weak nonexpansive mapping and a zero of monotone mapping. Furthermore, strong convergence of the scheme to a point which is a fixed point of relatively weak nonexpansive mapping and a zero of monotone mapping is proved.

• 대한수학회지
• /
• 제45권2호
• /
• pp.377-392
• /
• 2008

Let X be a real reflexive Banach space with a uniformly $G\hat{a}teaux$ differentiable norm, C a nonempty closed convex subset of X, T : C $\rightarrow$ X a continuous pseudocontractive mapping, and A : C $\rightarrow$ C a continuous strongly pseudocontractive mapping. We show the existence of a path ${x_t}$ satisfying $x_t=tAx_t+(1- t)Tx_t$, t $\in$ (0,1) and prove that ${x_t}$ converges strongly to a fixed point of T, which solves the variational inequality involving the mapping A. As an application, we give strong convergence of the path ${x_t}$ defined by $x_t=tAx_t+(1-t)(2I-T)x_t$ to a fixed point of firmly pseudocontractive mapping T.

• International Journal of CAD/CAM
• /
• 제8권1호
• /
• pp.29-36
• /
• 2009

Domain mapping is a bijective transformation of one domain to another, usually from a complicated general domain to a chosen convex domain. This is directly useful in many application problems like shape modeling, morphing, texture mapping, shape matching, remeshing, path planning etc. A new approach considering the domain as made up of structural elements, like membranes or trusses, is developed and implemented using the nonlinear finite element formulation. The mapping is performed in two stages, boundary mapping and inside mapping. The boundary of the 3-D domain is mapped to the surface of a convex domain (in this case, a sphere) in the first stage and then the displacement/distortion of this boundary is used as boundary conditions for mapping the interior of the domain in the second stage. This is a general method and it develops a bijective mapping in all cases with judicious choice of material properties and finite element analysis. The consistent global parameterization produced by this method for an arbitrary genus zero closed surface is useful in shape modeling. Results are convincing to accept this finite element structural approach for domain mapping as a good method for many purposes.

• East Asian mathematical journal
• /
• 제27권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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.936-939
• /
• 1996

In this paper, two specially designed associative mapping memories, called Associative Mapping Elements(AME) and Multiple-Digit Overlapping AME(MDO-AME), are presented for learning of nonlinear functions including kinematics and dynamics of robot manipulators. The proposed associative mapping memories consist of associative mapping rules(AMR) and weight update rules(WUR) which guarantee generalization and specialization of input-output relationship of learned nonlinear functions. Two simulation results, one for supervised learning and the other for unsupervised learning, are given to demonstrate the effectiveness of the proposed associative mapping memories.

• 한국IT서비스학회지
• /
• 제23권3호
• /
• pp.65-89
• /
• 2024

This study aims to enhance the continuous utilization of community mapping by structurally understanding the intentions behind its ongoing use and the impacts related to it, grounded in prior research. By analyzing existing community mapping cases through literature studies on community mapping, this research identifies the characteristics of community mapping that motivate its sustained use. Moreover, based on the Uses and Gratifications Theory and the Participatory Communication Model (PCM), this study proposes a research model to investigate the factors influencing the intention to continue using community mapping. Unlike previous studies, which primarily focused on developing and applying community mapping processes for case studies, this research not only develops and applies a community mapping process but also aims to apply the findings related to the intention of continued use in future community mapping activity processes for sustained engagement.