• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.744-746
• /
• 2003

A 3D modeling of urban area can be composed the terrain modeling that can express specific and shape of the terrain and the object modeling such as buildings, trees and facilities which are found in urban areas. Especially in a 3D modeling of building, it is very important to make a unit model by simplifying 3D structure and to take a texture mapping, which can help visualize surface information. In this study, the texture mapping technique, based on library for 3D urban modeling, was used for building modeling. This technique applies the texture map in the form of library which is constructed as building types, and then take mapping to the 3D building frame. For effectively apply, this technique, we classified buildings automatically using LiDAR data and made 3D frame using LiDAR and digital map. To express the realistic building texture, we made the texture library using real building photograph.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.670-672
• /
• 2001

소프트웨어 산업계에서 재사용 단위가 객체보다 더 큰 컴포넌트 기반의 개발에 관심이 집중되고 있다. 그래서 모델링 언어인 UML과 컴포넌트가 운용되는 유연하고 확장성 높은 기반 아키텍처인 EJB를 이용한 기업형 시스템 개발이 요즘 기업에서 활발해지고 있다. UML과 EJB 각각에 대한 연구는 많이 진행되었지만, UML Model을 이용한 EJB Model 구현시의 mapping 기법에 관한 연구는 아직 미흡한 실정이다. 그래서 본 논문에서는 UML Modeling을 통해 Class diagram에서 추출된 Class들이 EJB로 구현될 때 실제로 어떤 Bean으로 Mapping 되는지에 대해 제시한다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.1
• /
• pp.1-7
• /
• 2008

The government is spending a large amount of budget to establish NGIS due to the importance of geospatial information. This paper deals with the study of schema mapping technique which can efficiently establish military topographic DB forest layer using digital forest map and other existing geospatial DB. In order to accomplish this each schema of these types of DB was analyzed then, mapping table which connects related attributes was created and finally, military topographical DB forest layer of the area of interest was efficiently established. This research was able to display solutions that resolved compatibility issues between existing geospatial DB of these types, established by the schema mapping techniques described in this research.

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

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

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.430-433
• /
• 2005

In this study, weight of evidence(WOE) technique based on the bayesian method was applied to estimate the groundwater yield characteristics in the Pocheon area in Kyungki-do. The ground water preservation depends on many hydrogeologic factors that include hydrologic data, landuse data, topographic data, geological map and other natural materials, even with man-made things. All these data can be digitally collected and managed by GIS database. In the applied technique of WOE, The prior probabilities were estimated as the factors that affect the yield on lineament, geology, drainage pattern or river system density, landuse and soil. We calculated the value of the Weight W+, W- of each factor and estimated the contrast value of it. Results by the ground water yield characteristic calculations were presented in the form of posterior probability map to the consideration of in-situ samples. It is concluded that this technique is regarded as one of the effective technique for the feasibility mapping related to detection of groundwater bearing zones and its spatial pattern.

• Structural Engineering and Mechanics
• /
• v.28 no.4
• /
• pp.461-477
• /
• 2008

An adaptive finite element method for analyzing two-dimensional and axisymmetric nonlinear elastic fracture mechanics problems with cracks is presented. The J-integral is used as a parameter to characterize the severity of stresses and deformation near crack tips. The domain integral technique, for which all relevant quantities are integrated over any arbitrary element areas around the crack tips, is utilized as the J-integral solution scheme with 9-node degenerated crack tip elements. The solution accuracy is further improved by incorporating an error estimation procedure onto a remeshing algorithm with a solution mapping scheme to resume the analysis at a particular load level after the adaptive remeshing technique has been applied. Several benchmark problems are analyzed to evaluate the efficiency of the combined domain integral technique and the adaptive finite element method.

• Proceedings of the Optical Society of Korea Conference
• /
• 2008.02a
• /
• pp.181-182
• /
• 2008

In this paper, we propose a volumetric computational reconstruction method by use of smart pixel mapping technique in the computational integral imaging in order to overcome the problem of resolution degradation. The experimental results are presented to show the usefulness of our proposed technique.

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.159-169
• /
• 2009

In this paper, we introduce a generalized system of nonlinear relaxed co-coercive variational inclusions involving (A, ${\eta}$)-monotone map-pings in the framework of Hilbert spaces. Based on the generalized resol-vent operator technique associated with (A, ${\eta}$)-monotonicity, we consider the approximation solvability of solutions to the generalized system. Since (A, ${\eta}$)-monotonicity generalizes A-monotonicity and H-monotonicity, The results presented this paper improve and extend the corresponding results announced by many others.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.108-121
• /
• 2004

In this paper, we propose an enhanced snapshot technique that solves performance degradation when snapshot is initiated for the storage cluster system. However, traditional snapshot technique has some limits adapted to large amount storage shared by multi-hosts in the following aspects. As volume size grows, (1) it deteriorates crucially the performance of write operations due to additional disk access to verify COW is performed. (2) Also it increases excessively the blocking time of write operation performed during the snapshot creation time. (3)Finally, it deteriorates the performance of write operations due to additional disk I/O for mapping block caused by the verification of COW. In this paper, we propose an efficient snapshot technique for large amount storage shared by multi-hosts in SAN Environments. We eliminate the blocking time of write operation caused by freezing while a snapshot creation is performing. Also to improve the performance of write operation when snapshot is taken, we introduce First Allocation Bit(FAB) and Snapshot Status Bit(SSB). It improves performance of write operation by reducing an additional disk access to volume disk for getting snapshot mapping block. We design and implement an efficient snapshot technique, while the snapshot deletion time, improve performance by deallocation of COW data block using SSB of original mapping entry without snapshot mapping entry obtained mapping block read from the shared disk.