• 제목/요약/키워드: Grid-based data

Search Result 1,148, Processing Time 0.03 seconds

A Study on Efficient Technique of 3-D Terrain Modelling (3차원 지형모델링의 효율적 기법에 관한 연구)

  • 윤철규;신봉호;양승룡;엄재구
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.15 no.2
    • /
    • pp.207-213
    • /
    • 1997
  • The purpose of this study is to aim at presenting efficient technique of 3-D Terrain Modelling through multilateral approach methods and to compare with raw data, using low-densed randomly located point data. The subject religion of this study are selected two sites and take into consideration for degree of freedom about low-densed randomly located point data. The result of this study by precision analysis of digital cartographic map-ping using low-densed randomly located point data bave shown that . First, making digital cartographic map, the technique of making it using low-desned randomly located point data by TIN-based results to good and fast run-time in A and B sites all together. Second, the visualization analysis results of digital cartographic map using TIN and GRID-based terrain modeling techniqus similar exacts A and B sites, but the terrain modeling techniqus by TIN-based are small data size than GRID-based with the data with the data size of saving with DXF files. Third, making digital catographic map using terrain modeling techniques by Grid-based, the standard errors of low-densed randomly located point data and interpolated data using gridding method have more good results by radial basis function interpolation techniques at A and B sites all together.

  • PDF

PARALLEL IMPROVEMENT IN STRUCTURED CHIMERA GRID ASSEMBLY FOR PC CLUSTER (PC 클러스터를 위한 정렬 중첩 격자의 병렬처리)

  • Kim, Eu-Gene;Kwon, Jang-Hyuk
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.157-162
    • /
    • 2005
  • Parallel implementation and performance assessment of the grid assembly in a structured chimera grid approach is studied. The grid assembly process, involving hole cutting and searching donor, is parallelized on the PC cluster. A message passing programming model based on the MPI library is implemented using the single program multiple data(SPMD) paradigm. The coarse-grained communication is optimized with the minimized memory allocation because that the parallel grid assembly can access the decomposed geometry data in other processors by only message passing in the distributed memory system such as a PC cluster. The grid assembly workload is based on the static load balancing tied to flow solver. A goal of this work is a development of parallelized grid assembly that is suited for handling multiple moving body problems with large grid size.

  • PDF

Development of Realtime GRID Analysis Method based on the High Precision Streaming Data

  • Lee, HyeonSoo;Suh, YongCheol
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.6
    • /
    • pp.569-578
    • /
    • 2016
  • With the recent advancement of surveying and technology, the spatial data acquisition rates and precision have been improved continually. As the updates of spatial data are rapid, and the size of data increases in line with the advancing technology, the LOD (Level of Detail) algorithm has been adopted to process data expressions in real time in a streaming format with spatial data divided precisely into separate steps. The existing GRID analysis utilizes the single DEM, as it is, in examining and analyzing all data outside the analysis area as well, which results in extending the analysis time in proportion to the quantity of data. Hence, this study suggests a method to reduce analysis time and data throughput by acquiring and analyzing DEM data necessary for GRID analysis in real time based on the area of analysis and the level of precision, specifically for streaming DEM data, which is utilized mostly for 3D geographic information service.

Study on the Methodology for Generating Future Precipitation Data by the Rural Water District Using Grid-Based National Standard Scenario (격자단위 국가 표준 시나리오를 적용한 농촌용수구역단위 자료변환 방법 비교 연구)

  • Kim, Siho;Hwang, Syewoon
    • Journal of The Korean Society of Agricultural Engineers
    • /
    • v.65 no.3
    • /
    • pp.69-82
    • /
    • 2023
  • Representative meteorological data of the rural water district, which is the spatial unit of the study, was produced using the grid-based national standard RCP scenario rainfall data provided by the Korea Meteorological Administration. The retrospective reproducibility of the climate model scenario data was analyzed, and the change in climate characteristics in the water district unit for the future period was presented. Finally the data characteristics and differences of each meteorological element according to various spatial resolution conversion and post-processing methods were examined. As a main result, overall, the distribution of average precipitation and R95p of the grid data, has reasonable reproducibility compared to the ASOS observation, but the maximum daily rainfall tends to be distributed low nationwide. The number of rainfall days tends to be higher than the station-based observation, and this is because the grid data is generally calculated using the area average concept of representative rainfall data for each grid. In addition, in the case of coastal regions, there is a problem that administrative districts of islands and rural water districts do not match. and In the case of water districts that include mountainous areas, such as Jeju, there was a large difference in the results depending on whether or not high rainfall in the mountainous areas was reflected. The results of this study are expected to be used as foundation for selecting data processing methods when constructing future meteorological data for rural water districts for future agricutural water management plans and climate change vulnerability assessments.

Comparative Analysis of Centralized Vs. Distributed Locality-based Repository over IoT-Enabled Big Data in Smart Grid Environment

  • Siddiqui, Isma Farah;Abbas, Asad;Lee, Scott Uk-Jin
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2017.01a
    • /
    • pp.75-78
    • /
    • 2017
  • This paper compares operational and network analysis of centralized and distributed repository for big data solutions in the IoT enabled Smart Grid environment. The comparative analysis clearly depicts that centralize repository consumes less memory consumption while distributed locality-based repository reduce network complexity issues than centralize repository in state-of-the-art Big Data Solution.

  • PDF

Dynamic Replication Based on Availability and Popularity in the Presence of Failures

  • Meroufel, Bakhta;Belalem, Ghalem
    • Journal of Information Processing Systems
    • /
    • v.8 no.2
    • /
    • pp.263-278
    • /
    • 2012
  • The data grid provides geographically distributed resources for large-scale applications. It generates a large set of data. The replication of this data in several sites of the grid is an effective solution for achieving good performance. In this paper we propose an approach of dynamic replication in a hierarchical grid that takes into account crash failures in the system. The replication decision is taken based on two parameters: the availability and popularity of the data. The administrator requires a minimum rate of availability for each piece of data according to its access history in previous periods, but this availability may increase if the demand is high on this data. We also proposed a strategy to keep the desired availability respected even in case of a failure or rarity (no-popularity) of the data. The simulation results show the effectiveness of our replication strategy in terms of response time, the unavailability of requests, and availability.

PC-Based Hybrid Grid Computing for Huge Biological Data Processing

  • Cho, Wan-Sup;Kim, Tae-Kyung;Na, Jong-Hwa
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.569-579
    • /
    • 2006
  • Recently, the amount of genome sequence is increasing rapidly due to advanced computational techniques and experimental tools in the biological area. Sequence comparisons are very useful operations to predict the functions of the genes or proteins. However, it takes too much time to compare long sequence data and there are many research results for fast sequence comparisons. In this paper, we propose a hybrid grid system to improve the performance of the sequence comparisons based on the LanLinux system. Compared with conventional approaches, hybrid grid is easy to construct, maintain, and manage because there is no need to install SWs for every node. As a real experiment, we constructed an orthologous database for 89 prokaryotes just in a week under hybrid grid; note that it requires 33 weeks on a single computer.

  • PDF

AUTOMATED TRIANGULAR SURFACE GRID GENERATION ON CAD SURFACE DATA (CAD 형상 데이터를 이용한 물체 표면 삼각형 격자의 자동 생성 기법)

  • Lee, B.J.;Kim, B.S.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2007.04a
    • /
    • pp.103-107
    • /
    • 2007
  • Computational Fluid Dynamics (CFD in short) approach is now playing an important role in the engineering process recently. Generating proper grid system for the region of interest in time is prerequisite for the efficient numerical calculation of flow physics using CFD approach. Grid generation is, however, usually considered as a major obstacle for a routine and successful application of numerical approaches in the engineering process. CFD approach based on the unstructured grid system is gaining popularity due to its simplicity and efficiency for generating grid system compared to the structured grid approaches. In this paper an automated triangular surface grid generation using CAD surface data is proposed According to the present method, the CAD surface data imported in the STL format is processed to identify feature edges defining the topology and geometry of the surface shape first. When the feature edges are identified, node points along the edges are distributed. The initial fronts which connect those feature edge nodes are constructed and then they are advanced along the CAD surface data inward until the surface is fully covered by triangular surface grid cells using Advancing Front Method. It is found that this approach can be implemented in an automated way successfully saving man-hours and reducing human-errors in generating triangular surface grid system.

  • PDF

Grid Based Nonpoint Source Pollution Load Modelling

  • Niaraki, Abolghasem Sadeghi;Park, Jae-Min;Kim, Kye-Hyun;Lee, Chul-Yong
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.246-251
    • /
    • 2007
  • The purpose of this study is to develop a grid based model for calculating the critical nonpoint source (NPS) pollution load (BOD, TN, TP) in Nak-dong area in South Korea. In the last two decades, NPS pollution has become a topic for research that resulted in the development of numerous modeling techniques. Watershed researchers need to be able to emphasis on the characterization of water quality, including NPS pollution loads estimates. Geographic Information System (GIS) has been designed for the assessment of NPS pollution in a watershed. It uses different data such as DEM, precipitation, stream network, discharge, and land use data sets and utilizes a grid representation of a watershed for the approximation of average annual pollution loads and concentrations. The difficulty in traditional NPS modeling is the problem of identifying sources and quantifying the loads. This research is intended to investigate the correlation of NPS pollution concentrations with land uses in a watershed by calculating Expected Mean Concentrations (EMC). This work was accomplished using a grid based modelling technique that encompasses three stages. The first step includes estimating runoff grid by means of the precipitation grid and runoff coefficient. The second step is deriving the gird based model for calculating NPS pollution loads. The last step is validating the gird based model with traditional pollution loads calculation by applying statistical t-test method. The results on real data, illustrate the merits of the grid based modelling approach. Therefore, this model investigates a method of estimating and simulating point loads along with the spatially distributed NPS pollution loads. The pollutant concentration from local runoff is supposed to be directly related to land use in the region and is not considered to vary from event to event or within areas of similar land uses. By consideration of this point, it is anticipated that a single mean estimated pollutant concentration is assigned to all land uses rather than taking into account unique concentrations for different soil types, crops, and so on.

  • PDF

Density Adaptive Grid-based k-Nearest Neighbor Regression Model for Large Dataset (대용량 자료에 대한 밀도 적응 격자 기반의 k-NN 회귀 모형)

  • Liu, Yiqi;Uk, Jung
    • Journal of Korean Society for Quality Management
    • /
    • v.49 no.2
    • /
    • pp.201-211
    • /
    • 2021
  • Purpose: This paper proposes a density adaptive grid algorithm for the k-NN regression model to reduce the computation time for large datasets without significant prediction accuracy loss. Methods: The proposed method utilizes the concept of the grid with centroid to reduce the number of reference data points so that the required computation time is much reduced. Since the grid generation process in this paper is based on quantiles of original variables, the proposed method can fully reflect the density information of the original reference data set. Results: Using five real-life datasets, the proposed k-NN regression model is compared with the original k-NN regression model. The results show that the proposed density adaptive grid-based k-NN regression model is superior to the original k-NN regression in terms of data reduction ratio and time efficiency ratio, and provides a similar prediction error if the appropriate number of grids is selected. Conclusion: The proposed density adaptive grid algorithm for the k-NN regression model is a simple and effective model which can help avoid a large loss of prediction accuracy with faster execution speed and fewer memory requirements during the testing phase.