• 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 Printing Society Conference
• /
• 2002.05a
• /
• pp.10-18
• /
• 2002

On the process of cross-media color reproduction, a key feature is the use of gamut mapping techniques to adjust the different color gamuts between displays and printers. Even though a number of GMAs have been published, but there are no method satisfactory enough for more exect color reproduction. In this paper, the gamut mapping methods of nearest point clipping(NPC), centroid clipping (SLIN), straight clipping and cusp clipping(CUSP) were tested and analyzed with color difference, and a new gamut mapping algorithm based on variable anchor point method was proposed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.611-619
• /
• 2008

2.5D Mapping system that embody in this paper can make new design by doing draping to live various texture and model picture image of fashion clothes by pattern, and can confirm clothes work to simulation without producing direction sample or product directly. Also, the system can support function that can forecast fabric design and state of end article exactly, and the system can bring competitive power elevation of fashion industry and cost-cutting effect by doing draping using database of fabric and model picture image. 2.5D Mapping system composed and embodied by mesh warp algorithm module, light and shade extraction and application module, mapping path extraction module, mesh creation and transformation module, and 2.5D mapping module for more natural draping. Future work plans to study 3D fashion design system that graft together 3D clothes technology and 3D human body embodiment technology to do based on embodiment technology of 2.5D mapping system and overcomes expression limit of 2.5D mapping technology.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.78-87
• /
• 2013

NAND flash memory has been widely used as a storage medium in mobile devices, PCs, and workstations due to its advantages such as low power consumption, high performance, and random accessability compared to a hard disk drive. However, NAND flash cannot support in-place update so that it is mandatory to erase the entire block before overwriting the corresponding page. In order to overcome this drawback, flash storages need a software support, named Flash Translation Layer. However, as the high performance mass NAND flash memory is getting widely used, the size of mapping tables is increasing more than the limited DRAM size. In this paper, we propose an adaptive mapping information caching algorithm based on page mapping to solve this DRAM space shortage problem. Our algorithm uses a mapping information caching scheme which minimize the flash memory access frequency based on the analysis of several workloads. The experimental results show that the proposed algorithm can increase the performance by up to 70% comparing with the previous mapping information caching algorithm.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.4
• /
• pp.180-187
• /
• 2001

This paper proposes an efficient evolutionary programming algorithm for solving a generation expansion planning(GEP) problem known as a highly-nonlinear dynamic problem. Evolutionary programming(EP) is an optimization algorithm based on the simulated evolution (mutation, competition and selection). In this paper, new algorithm is presented to enhance the efficiency of the EP algorithm for solving the GEP problem. By a domain mapping procedure, yearly cumulative capacity vectors are transformed into one dummy vector, whose change can yield a kind of trend in the cost value. To validate the proposed approach, this algorithm is tested on two cases of expansion planning problems. Simulation results show that the proposed algorithm can provide successful results within a resonable computational time compared with conventional EP and dynamic programming.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.6
• /
• pp.58-64
• /
• 2009

For the success of the reconfigurable computing, the algorithm for mapping operations onto coarse-grained reconfigurable architecture is very important. This paper proposes a resource-aware mapping system for the coarse-grained reconfigurable architecture and its own underlying heuristic algorithm. The operation assignment and the routing path allocation are simultaneously performed with a cycle-accurate time-exclusive resource model. The proposed algorithm minimizes the communication resource usage and the global memory access with the list scheduling heuristic. The operation to be mapped are prioritized with general properties of data flow. The evaluations of the proposed algorithm show that the performance is significantly enhanced in several benchmark applications.

• Journal of Ocean Engineering and Technology
• /
• v.38 no.4
• /
• pp.187-198
• /
• 2024

Autonomous underwater vehicles (AUVs) have a limited bandwidth for real-time communication, limiting rapid responses to unexpected obstacles. This study addressed how AUVs can navigate to a target without a pre-existing obstacle map by generating one in real-time and avoiding obstacles. This paper proposes using forward-looking sonar with an occupancy grid map (OGM) for real-time obstacle mapping and a potential field algorithm for avoiding obstacles. The OGM segments the map into grids, updating the obstacle probability of each cell for precise, quick mapping. The potential field algorithm attracts the AUV towards the target and uses repulsive forces from obstacles for path planning, enhancing computational efficiency in a dynamic environment. Experiments were conducted in coastal waters with obstacles to verify the real-time obstacle mapping and avoidance algorithm. Despite the high noise in sonar data, the experimental results confirmed effective obstacle mapping and avoidance. The OGM-based potential field algorithm was computationally efficient, suitable for single-board computers, and demonstrated proper parameter adjustments through two distinct scenarios. The experiments also identified some of challenges, such as dynamic changes in detection rates, propulsion bubbles, and changes in repulsive forces caused by sudden obstacles. An enhanced algorithm to address these issues is currently under development.

• Journal of Biomedical Engineering Research
• /
• v.21 no.2
• /
• pp.157-163
• /
• 2000

최근 MR영상을 허혈성 뇌졸중의 초급성기에 뇌조직의 관류 이상을 조기에 진단하려는 연구들이 진행되고 있으나 아직 일반적인 진단용 소프트웨어만 있을 뿐 영상 자료를 후처리하여 뇌조직의 구조 및 기능적인 정보를 제공하는 mapping 영상을 특수 소프트웨어는 실용화되어 있지 않다. 본 논문에서는 Gamma-variate 곡선 정합을 이용한 뇌관류 파라미터 영상 mapping의 알고리즘 구현에 관해 연구하였다. 관류 MR영상의 각 화소마다 측정된 시간에 따른 신호강도의 변화 곡선은 비선형적이어서 뇌관류에 관한 여러 가지 혈역학적 변수들을 보다 정확하게 계산할 수 없었다. 그래서 수렴속도가 빠르고 안정성이 높은 비선형 최적화 알고리즘인 Levenberg-Marquardt 알고리즘(LMA)을 활용하였다. 즉 시간에 따른 신호강도의 변화 곡선을 Gamma-variate 함수를 이용하여 곡선 정합한 후, CBV, MTT, CBF, TTP, BAT, MS의 여러 가지 혈역학적 변수를 LMA에 의해 계산하였다. 그 결과로 관류 MR영상으로부터 얻은 mapping 영상은 초급성 허혈성 뇌졸중에서 관류에 관한 혈역학적 변화를 평가함으로써 나중에 생길 뇌경색의 범위를 예견하는 데에 유용하였다.

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