• 한국지하수토양환경학회:학술대회논문집
• /
• 한국지하수토양환경학회 2003년도 추계학술발표회
• /
• pp.140-143
• /
• 2003

Air permeabilities in unsaturated fractured tuff at the Apache Leap Research Site (ALRS) near Superior, Arizona, exhibit a self-affine behavior, thus renders a field random fractal. Based up fractal scaling, the observed scale effect has been interpreted [Hyun et al., 2002]. Recently, Frantziskonis and Hansen [2000] presented that fractal scaling can be represented based on wavelets. This study deals with the way of using wavelets for fractal scaling. A numerical study is presented to examine the applicability of wavelet-based approach to determining upscaled air permeability values on various data supports at the site. To characterize the scaling property of self-affine fields generated based upon wavelets, Hurst coefficient, H. was inferred by applying the average wavelet coefficient (AWC) method. The result yielded H = 0.24, which is very close to the result of geostatistical analysis using a power variogram (H = 0.22). The study concludes that wavelet-based scaling is a useful way of determining parameter values on different data supports, which is an essential task for modeling of subsurface flow and mass transport in a numeric grid with different resolutions (grid size).

• 한국측량학회지
• /
• 제15권2호
• /
• pp.207-213
• /
• 1997

본 연구는 저밀도 임의지점의 지형정보를 이용하여 수치지형도를 제작하는데 있어 시간적, 경제적 측면을 포함하는 효율성과 정밀도 측면에서 각각의 수치지형도 제작기법을 비교 분석하여 향후 지형정보시스템의 구축에 있어서 저밀도의 제한된 지형정보를 이용하여 지형분석과 같은 많은 응용분야에 유용하게 이용될 수 있는 3차원 지형모델링의 효율적 기법을 제시하는 연구로써 다음과 같은 결론을 얻었다. 수치지형도를 제작함에 있어 A, B지역 모두 저밀도 임의지점의 지형정보를 이용하여 TIN기반의 지형모델링 기법으로 수치지형도를 제작하는 기법이 가장 신속하면서도 양호한 결과를 가져왔으며 TIN과 GRID기반의 지형모델링 기법으로 제작한 수치지형도를 시각적으로 분석한 결과 A, B지역모두 거의 홉사한 결과를 가져왔으나 DXF 파일로 저장한 데이터의 크기는 TIN기반의 지형모델링 기법이 GRID기반보다 상대적으로 적은 저장용량을 차지하는 것으로 나타났다. 또한 Grid기반의 지형모델링 기법에 의해 제작한 수치지형도에 있어서 저밀도 임의지점의 원형 데이터와 Gridding방법에 의해 보간된 데이터의 표준편차는 A, B지역 모두 Radial basis function 보간기법이 가장 정밀한 보간 결과를 제시하였다.

• ETRI Journal
• /
• 제42권4호
• /
• pp.608-618
• /
• 2020

We present a novel GPU-based ray-casting algorithm for volume rendering of unstructured grid data. Our volume rendering system uses a ray-casting method that guarantees accurate rendering results. We also employ the per-pixel intersection list concept in the Bunyk algorithm to guarantee an accurate result for non-convex meshes. For efficient memory access for the lists on the GPU, we represent the intersection lists for all faces as an array with our novel construction algorithm. With the intersection lists, we perform ray-casting on a GPU, and a GPU thread handles each ray. To increase ray-coherency in a thread block and improve memory access efficiency, we extend a prior image-tile-based work distribution method to fit modern GPU architectures. We also show that a prior approach using a per-thread local buffer to reduce redundant computation is not appropriate for modern GPU architectures. Instead, we take an on-demand calculation strategy that achieves better performance even though it allows duplicate computations. We applied our method to three unstructured grid datasets with different characteristics. With a GPU, our method achieved up to 36.5 times higher performance for the ray-casting process and 19.7 times higher performance for the whole volume rendering process compared with the Bunyk algorithm using a CPU core. Also, our approach showed up to 8.2 times higher performance than a GPU-based cell projection method while generating more accurate rendering results. These results demonstrate the efficiency and accuracy of our method.

• 전자공학회논문지A
• /
• 제32A권2호
• /
• pp.31-37
• /
• 1995

A ray-based approach is developed to calculate the scattering from inhomogeneous dielectric objects. This approach is a natural extension of the "shooting and bouncing ray(SBR)" technique developed earlier for calculating the radar cross section of cavity structures and complex targets. In this formulation, a dense grid of rays representing the incident field is shot toward the scatterer. The curved trajectory, amplitude, phase and polarization of the ray fields inside the inhomogeneous object are computed numerically based on the laws of geometrical optics. The contributions of the exting rays to the exterior scattered field are then calculated by using the equivalence principle in conjunction with " a ray-tube integration" scheme. The ray-based approach is applied for the effect of an arcjet plasma plume on satellite reflector performance and backscattering from inhomogeneous objects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권9호
• /
• pp.2213-2231
• /
• 2013

Compressed sensing is a novel technology used in the field of wireless communication and sensor networks for channel estimation, signal detection, data gathering, network monitoring, and other applications. It plays a significant role in highly secure, real-time, well organized, and cost-effective data communication in smart-grid (SG) systems, which consist of multi-tier network standards that make it challenging to synchronize in power management communication. In this paper, we present a multi-layer communication model for SG systems and propose compressed-sensing based data transmission at every layer of the SG system to improve data transmission performance. Our approach is to utilize the compressed-sensing procedure at every layer in a controlled manner. Simulation results demonstrate that the proposed monitoring devices need less transmission power than conventional systems. Additionally, secure, reliable, and real-time data transmission is possible with the compressed-sensing technique.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.253-253
• /
• 2000

Each robot plays a role of its own behavior in dynamic robot-soccer environment. One of the most necessary conditions to win a game is control of robot movement. In this paper we suggest a win strategy using Cellular Neural Network to set optimal path and cooperative behavior, which divides a soccer ground into grid-cell based ground and has robots move a next grid-cell along the optimal path to approach the moving target.

• 한국측량학회지
• /
• 제38권5호
• /
• pp.407-414
• /
• 2020

SVM (Support vector machine) analysis was performed after applying a deep learning technique based on an Inception-based model (GoogLeNet). The accuracy of automatic image classification was analyzed using an SVM with multiple virtual grid sizes. Six classes were selected from a standard land cover map. Cars were added as a separate item to increase the classification accuracy of roads. The virtual grid size was 2-5 m for natural areas, 5-10 m for traffic areas, and 10-15 m for building areas, based on the size of items and the resolution of input images. The results demonstrate that automatic classification accuracy can be increased by adopting an integrated approach that utilizes weighted virtual grid sizes for different classes.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2002년도 제7회 단조 심포지엄
• /
• pp.105-112
• /
• 2002

A new grid-based approach is presented for automatic generation of hexahedral meshes for simulation of plastic deformation in metal forming. In this approach, special enveloping schemes are applied, to eradicate the sources of the degenerate elements that may appear in a generated mesh. The schemes are described in detail, along with a complete procedure for mesh generation. The capability of the approach to deal with an arbitrary, 3-D process geometry is demonstrated through application to a selected forming problem.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1994년도 추계학술대회 논문집
• /
• pp.298-302
• /
• 1994

A three dimensional FE mesh generation scheme based on mapping approach is proposed in this study. A volume in Euclcdian space is represented by composite hyperpatches which are piecewise cubic functions with parameters u,v,w. A key idea in the proposed approach is that sampled grid data points only on the boundary surfaces are needed for the shape representation. Inner points which are necessary of form a hyperpatch are internally generated by Coons patches. This approach is most appropriate for the shapes which are compositions of hexahedron-like shapes and also severely curved.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2007년도 한국컴퓨터종합학술대회논문집 Vol.34 No.1 (C)
• /
• pp.336-340
• /
• 2007

We envisage that grid computing environments allow us to implement distributed data mining services, that is, those applications which analyze large sets of geographically distributed databases and information using the computational power and resources of a grid environment. This paper describes an experimental framework towards such a distributed data mining approach, including design considerations and a prototype implementation. Based on the "Knowledge Grid" architecture suggested by Cannataro et al., we identify four major components - user node, broker node, data node, and computation node - and define their individual roles. For implementing the prototype, we have investigated methods for utilizing distributed resources within a grid computing environment, e.g., communication and coordination among the various resources available.