• Title/Summary/Keyword: Spatial Grid

Search Result 702, Processing Time 0.028 seconds

Countinuous k-Nearest Neighbor Query Processing Algorithm for Distributed Grid Scheme (분산 그리드 기법을 위한 연속 k-최근접 질의처리 알고리즘)

  • Kim, Young-Chang;Chang, Jae-Woo
    • Journal of Korea Spatial Information System Society
    • /
    • v.11 no.3
    • /
    • pp.9-18
    • /
    • 2009
  • Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.

  • PDF

Discontinuous Grids and Time-Step Finite-Difference Method for Simulation of Seismic Wave Propagation (지진파 전파 모의를 위한 불균등 격자 및 시간간격 유한차분법)

  • 강태섭;박창업
    • Proceedings of the Earthquake Engineering Society of Korea Conference
    • /
    • 2003.03a
    • /
    • pp.50-58
    • /
    • 2003
  • We have developed a locally variable time-step scheme matching with discontinuous grids in the flute-difference method for the efficient simulation of seismic wave propagation. The first-order velocity-stress formulations are used to obtain the spatial derivatives using finite-difference operators on a staggered grid. A three-times coarser grid in the high-velocity region compared with the grid in the low-velocity region is used to avoid spatial oversampling. Temporal steps corresponding to the spatial sampling ratio between both regions are determined based on proper stability criteria. The wavefield in the margin of the region with smaller time-step are linearly interpolated in time using the values calculated in the region with larger one. The accuracy of the proposed scheme is tested through comparisons with analytic solutions and conventional finite-difference scheme with constant grid spacing and time step. The use of the locally variable time-step scheme with discontinuous grids results in remarkable saving of the computation time and memory requirement with dependency of the efficiency on the simulation model. This implies that ground motion for a realistic velocity structures including near-surface sediments can be modeled to high frequency (several Hz) without requiring severe computer memory

  • PDF

A Windowed-Total-Variation Regularization Constraint Model for Blind Image Restoration

  • Liu, Ganghua;Tian, Wei;Luo, Yushun;Zou, Juncheng;Tang, Shu
    • Journal of Information Processing Systems
    • /
    • v.18 no.1
    • /
    • pp.48-58
    • /
    • 2022
  • Blind restoration for motion-blurred images is always the research hotspot, and the key for the blind restoration is the accurate blur kernel (BK) estimation. Therefore, to achieve high-quality blind image restoration, this thesis presents a novel windowed-total-variation method. The proposed method is based on the spatial scale of edges but not amplitude, and the proposed method thus can extract useful image edges for accurate BK estimation, and then recover high-quality clear images. A large number of experiments prove the superiority.

A Study on the Grid Architecture of Urban Facility Management in u-City (u-City 도시시설물 관리 GRID 시스템 아키텍처에 관한 연구)

  • Kwon, Hyuk-Jong;Lim, Hyung-Chang;Kim, Won-Kyun;Oh, Yoon-Seuk;Nam, Sang-Kwan
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.06a
    • /
    • pp.492-496
    • /
    • 2008
  • 최근 u-City에서 추진되고 있는 도시시설물 관리 관리시스템은 USN을 기반으로 이루어지고 있으며, 도시시설물에 센서노드를 구축하고, 수집되는 Sensing 데이터를 활용하여 시설물관리를 지능화하고 있다. 본 논문은 관리 시설물에 따라 부착된 센서 데이터를 수집하여 활용함에 있어 GRID 기술을 적용하고, 이 GRID 시스템을 통해 시스템 자원에 대한 효용성을 높일 수 있는 도시시설물 관리 통합 GRID 시스템 구성을 제시하고자 한다.

  • PDF

A Dynamic Reorganization Method using the Hierarchical Structure in the Grid Database (그리드 데이터베이스에서 계층 구조를 이용한 동적 재조직 기법)

  • Cheon, Jong-Hyeon;Jang, Yong-Il;Cho, Sook-Kyoung;Lee, Soon-Jo;Bae, Hae-Young
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.1 s.16
    • /
    • pp.93-106
    • /
    • 2006
  • A Grid Database is a database management system to process effectively and use the distributed data in a grid computing environment. Spatial data is more important than other general data according to the local characteristics and requires a large storage. The grid database can be used as the optimal system for the management of the spatial data. However, contrary to the conventional distributed database systems, the Grid Database which guarantees the local autonomy has a possibility not to provide an effective system, or it is impossible to use a centralized management environment. In order to allow flexible responses to a dynamically changing environment, it is required to use effectively reorganized method. In this paper, hierarchical reorganization method is presented for dynamic reorganization in a grid database. When the reorganization is conducted, an organizer is created to collect the information of databases. In addition, the organizer which is constructed by the hierarchical structure supports information communication and reorganization, and then it allows the support of regional reorganization operation and effective balance control. The performance assessment of the proposed method shows that the processing capacity is increased after the reorganization.

  • PDF

On a new fourth order self-adaptive time integration algorithm

  • Zhong, Wanxie;Zhu, Jianping
    • Structural Engineering and Mechanics
    • /
    • v.4 no.6
    • /
    • pp.589-600
    • /
    • 1996
  • An explicit 4th order time integration scheme for solving the convection-diffusion equation is discussed in this paper. A system of ordinary differential equations are derived first by discretizing the spatial derivatives of the relevant PDE using the finite difference method. The integration of the ODEs is then carried out using a 4th order scheme and a self-adaptive technique based on the spatial grid spacing. For a non-uniform spatial grid, different time step sizes are used for the integration of the ODEs defined at different spatial points, which improves the computational efficiency significantly. A numerical example is also discussed in the paper to demonstrate the implementation and effectiveness of the method.

Design of Spatial Clustering Method for Data Mining of Various Spatial Objects (다양한 공간객체의 데이터 마이닝을 위한 공간 클러스터링 기법의 설계)

  • 문상호;최진오;김진덕
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.4
    • /
    • pp.955-959
    • /
    • 2004
  • Existing Clustering Methods for spatial data mining process only Point objects, not spatial objects with polygonometry such as lines and areas. It is because that distance computation between objects with polygonometry for clustering is more complex than distance computation between point objects. To solve this problem, we design a clustering method based on regular grid cell structures. In details, it reduces cost and time for distance computation using cell relationships in grid cell structures.

Assessment of Groundwater Recharge via Grid-based Soil Mosture Routing (격자기반의 토양수분추적에 의한 지하수함양량 추정기법 개발)

  • 김성준;채효석
    • Proceedings of the Korean Society of Agricultural Engineers Conference
    • /
    • 1998.10a
    • /
    • pp.22-27
    • /
    • 1998
  • A grid-based soil moisture routing model(GRISMORM) was developed to assess the information of groundwater recharge using spatial data such as Landsat TM and digital elevation model etc.. The model predicts the hydrologic components, that is, surface runoff, subsurface runoff, baseflow and evapotranspiration at each grid elements by grid-based water balance computation.

  • PDF

Prediction of the Diffusion Controlled Boundary Layer Transition with an Adaptive Grid (적응격자계를 이용한 경계층의 확산제어천이 예측)

  • Cho J. R.
    • Journal of computational fluids engineering
    • /
    • v.6 no.4
    • /
    • pp.15-25
    • /
    • 2001
  • Numerical prediction of the diffusion controlled transition in a turbine gas pass is important because it can change the local heat transfer rate over a turbine blade as much as three times. In this study, the gas flow over turbine blade is simplified to the flat plate boundary layer, and an adaptive grid scheme redistributing grid points within the computation domain is proposed with a great emphasis on the construction of the grid control function. The function is sensitized to the second invariant of the mean strain tensor, its spatial gradient, and the interaction of pressure gradient and flow deformation. The transition process is assumed to be described with a κ-ε turbulence model. An elliptic solver is employed to integrate governing equations. Numerical results show that the proposed adaptive grid scheme is very effective in obtaining grid independent numerical solution with a very low grid number. It is expected that present scheme is helpful in predicting actual flow within a turbine to improve computation efficiency.

  • PDF