• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1907-1910
• /
• 2003

This paper describes a method of stereo image composition for mixed reality without camera calibration or complicate tracking algorithm. The proposed system tracks the panel which has blob makers, and composes virtual objects naturally using the method of texture mapping which is often used in geological computer graphics mapping when we do mapping 2D computer graphic data or man-made 2D images. The proposed algorithm makes it possible for us to compose virtual data even in the case that the panel is bent. For composing 3D object, the system uses depth information obtained from stereo image so that we do not need cumbersome procedure of camera calibration.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.30-43
• /
• 2013

Multicore and multiprocessor systems with dynamic voltage scaling architectures are being used as one of the solutions to satisfy the growing needs of high performance applications with low power constraints. An important aspect that has propelled this solution is effective task/application scheduling and mapping algorithms for multiprocessor systems. This work proposes an energy aware, offline, probability-based unified scheduling and mapping algorithm for multiprocessor systems, to minimize the number of processors used, maximize the utilization of the processors, and optimize the energy consumption of the multiprocessor system. The proposed algorithm is implemented, simulated and evaluated with synthetic task graphs, and compared with classical scheduling algorithms for the number of processors required, utilization of processors, and energy consumed by the processors for execution of the application task graphs.

• Korean Journal of Mathematics
• /
• v.24 no.2
• /
• pp.199-213
• /
• 2016

The resolvent operator approach of [2] is applied to solve a set-valued variational inclusion problem in ordered Hilbert spaces. The resolvent operator under consideration is called relaxed resolvent operator and we demonstrate some of its properties. To obtain the solution of a set-valued variational inclusion problem, an iterative algorithm is developed and weak-RRD set-valued mapping is used. The problem as well as main result of this paper are more general than many previous problems and results available in the literature.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.939-944
• /
• 2010

Let H be a real Hilbert space. Let T : $H\;{\rightarrow}\;H$ be an averaged mapping with $F(T)\;{\neq}\;{\emptyset}$. Let {$\alpha_n$} be a real numbers in (0, 1). For given $x_0\;{\in}\;H$, let the sequence {$x_n$} be generated iteratively by $x_{n+1}\;=\;(1\;-\;{\alpha}_n)Tx_n$, $n\;{\geq}\;0$. Assume that the following control conditions hold: (i) $lim_{n{\rightarrow}{\infty}}\;{\alpha}_n\;=\;0$; (ii) $\sum^{\infty}_{n=0}\;{\alpha}_n\;=\;{\infty}$. Then {$x_n$} converges strongly to a fixed point of T.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1040-1045
• /
• 2002

This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.75-77
• /
• 2003

The spatial distribution of snow cover area is a crucial input to models of hydrology and climate in alpine and other seasonally snow covered areas.The objective in our study is to develop a rapidly automatic and high accuracy snow cover mapping algorithm applicable for the Tibetan Plateau which is the most sensitive about climatic change. Monitoring regional snow extent reqires higher temoral frequency-moderate spatial resolution imagery.Our algorithm is based AVHRR and MODIS data and will provide long-term fraction snow cover area map.We present here a technique is based on the multiple endmembers approach and by taking advantages of current approaches, we developed a technique for automatic selection of local reference spectral endmembers.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.12
• /
• pp.1246-1253
• /
• 2009

To be high efficient for a navigation of unmanned ground vehicle, it must be able to distinguish between safe and hazardous regions in its immediate environment. We present an advanced method using laser range finder for building global 2D digital maps that include environment information. Laser range finder is used for mapping of obstacles and driving environment in the 2D laser plane. Rotary encoders are used for localization of UGV. The main contributions of this research are the development of an algorithm for global 2D map building and it will turn a UGV navigation based on map matching into a possibility. In this paper, a map building algorithm will be introduced and an assessment of algorithm reliability is judged at an each environment.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.6
• /
• pp.1455-1464
• /
• 1994

A new and efficient algorithm for the integration of the thermal-elasto-plastic constitutive equation is proposed. While it falls into the category of the return mapping method, the algorithm adopts the three point approximation of plastic corrector within one time increment step. The results of its application to a von Mises-type thermal-elasto-plastic model with combined hardening and temperature-dependent material properties show that the accurate iso-error maps are obtained for both angular and radial errors. The accuracy achieved is because the predicted stress increment in a single step calculation follows the exact value closely not only at the end of the step but also through the whole path. Also, the comparison of the computational time for the new and other algorithms shows that the new one is very efficient.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.2
• /
• pp.125-134
• /
• 1994

This paper proposes a new top-down technology mapping algorithm for minimizing the chip area and the path delay time of lookup table-based field programmable gate array(FPGA). First, we present the decomposition and factoring algorithm using common subexpre ssion which minimizes the number of basic logic blocks and levels instead of the number of literals. Secondly, we propose a cube packing algorithm considering the decomposition of gates which exceed m-input lookup table. Previous approaches perform the cube packing and the gate decomposition independently, and it causes to increase the number of basic logic blocks. Lastly, the efficiency.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.935-950
• /
• 2012

In this paper, we introduce and study a new system of generalized set-valued quasi-variational-like inclusions with (A, ${\eta}$)-accretive mapping in Banach spaces. By using the resolvent operator associated with (A, ${\eta}$)-accretive mappings, we construct a new iterative algorithm for approximating the solution of this system of variational inclusions. We also prove the existence of solutions and the convergence of the sequences generated by the algorithm in Banach spaces. The results presented in this paper extend and improve some known results in the literature.