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

• Nuclear Engineering and Technology
• /
• v.55 no.2
• /
• pp.655-668
• /
• 2023

In radiography, an antiscatter grid is a well-known device for eliminating unexpected x-ray scatter. We investigate a new stationary grid artifact suppression method based on a nonsubsampled contourlet transform (NSCT) incorporated with Gaussian band-pass filtering. The proposed method has an advantage that extracts the Moiré components while minimizing the loss of image information and apply the prior information of Moiré component positions in multi-decomposition sub-band images. We implemented the proposed algorithm and performed a simulation and an experiment to demonstrate its viability. We did this experiment using an x-ray tube (M-113T, Varian, focal spot size: 0.1 mm), a flat-panel detector (ROSE-M Sensor, Aspenstate, pixel dimension: 3032 × 3800 pixels, pixel size: 0.076 mm), and carbon graphite-interspaced grids (JPI Healthcare, 18 cm × 24 cm, line density: 103 LP/inch and 150 LP/inch, ratio: 5:1, focal distance: 65 cm). Our results indicate that the proposed method successfully suppressed grid artifacts by reducing them without either reducing the spatial resolution or causing negative side effects. Consequently, we anticipate that the proposed method can improve image acquisition in a stationary grid x-ray system as well as in extended x-ray imaging.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.592-602
• /
• 1995

Non-grid and grid method are used for modeling the routing region of the automatic routing system. In this study, we develop the automatic routing system by mixing the methods of non-grid and grid to improve the speed of routing. Grid method has a demerit which decreases the automatic routing speed because it is required a lot of memory by the limitation of the size of board and grid, although the electrical and physical elements are insufficient on the PCB, But non-grid is spent gurite less memory than grid method by using a shape-based patterns. Therefore, we used the methods of non-grid and grid altogether in this paper, In the former method, it is attributed to the improvement of speed, the latter one is applied only the connection of the failed routing in the former one, and it performs the complete automatic routing. This system was developed with C＋＋language under the Windows NT environment of IBM 486DX2-66 Computer.

• Journal of Power Electronics
• /
• v.15 no.2
• /
• pp.487-496
• /
• 2015

In order to ensure that photovoltaic (PV) systems work at the maximum power point (MPP) and maximize the economic benefits, maximum power point tracking (MPPT) techniques are normally applied to these systems. One of the most widely applied MPPT methods is the incremental conductance (INC) method. However, the choice of the step size still remains controversial. This paper presents an improved variable step size INC MPPT algorithm that uses four different step sizes. This method has the advantages of INC but with the ability to validly adjust the step size to adapt to changes of the PV's power curve. The presented algorithm also simultaneously achieves increased rapidity and accuracy when compared with the conventional fixed step size INC MPPT algorithm. In addition, the theoretical derivation and specific applications of the proposed algorithm are presented here. This method is validated by simulation and experimental results.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.18 no.11
• /
• pp.63-68
• /
• 2019

The dimensional quality of flexible foams is often difficult to be evaluated through general machine vision inspection methods due to the free deformation of the outer shape. For the evaluation of the dimensions of flexible foams, methods of estimating the size of the product through the expansion rate of the product surface are evaluated. Specimens with various dimensions and surface gratings are prepared, and the degree of surface expansion is measured through machine vision. The correlation, between the measured surface grid size and the actual size of test specimens, is analyzed. We further analyze the correlation between the size of test specimens and the position of the surface grid. This study provides a basis for estimating the actual dimensions of specimens by measuring the surface expansion of flexible foams.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.14 no.3
• /
• pp.183-195
• /
• 2012

This study conducted comparative analysis to estimate critical velocity in tunnel fire under variation of grid number and the location and size of the fire source using three-dimensional computational fluid dynamics. In the target tunnel, by one-dimensional way, the calculated critical velocity in the tunnel, 2.22 m/s was estimated, if appling hydraulic diameter, instead of the tunnel height. According to six numerical analysis, each grid number has different position, temperature, and CO concentration of back-layering. In the case of the subject, the case 1 with 0.84 million grid was found to be the most ideal. According to the location and size of the fire source, after three cases for three-dimensional numerical analysis was performed, it is resulted that the location and size of the fire source affect the critical velocity, because air velocity distribution, temperature distribution and CO concentration distribution showed different each case. This is due to the difference of heat exchange area and locations. Therefore, it is necessary to decide appropriate grid number, and the location and size of the fire source for processing techniques through comparison with actual experiment results and three-dimensional analysis.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.299-320
• /
• 2011

The overhead of processing fine-grain tasks on a grid induces the need for batch processing or task group deployment in order to minimise overall application turnaround time. When deciding the granularity of a batch, the processing requirements of each task should be considered as well as the utilisation constraints of the interconnecting network and the designated resources. However, the dynamic nature of a grid requires the batch size to be adaptable to the latest grid status. In this paper, we describe the policies and the specific techniques involved in the batch resizing process. We explain the nuts and bolts of these techniques in order to maximise the resulting benefits of batch processing. We conduct experiments to determine the nature of the policies and techniques in response to a real grid environment. The techniques are further investigated to highlight the important parameters for obtaining the appropriate task granularity for a grid resource.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.26 no.2
• /
• pp.75-81
• /
• 2021

This study analyzes the resonance characteristics caused by the mutual interference between LCL filters and the grid impedance under the parallel operation of the grid-connected inverter using the LCL filter. These characteristics are verified through simulation and experiment. Two inverters are used to connect to the grid in parallel, and the system parameters, including the LCL filter, are set to the same conditions. In the case of inverters running in parallel at the point of common coupling, the presence of grid impedance causes mutual interference between the LCL filters of each inverter, and the deviation of the filter resonance frequency is analyzed to understand the parallel inverter. The correlation between the number of devices and the size of grid impedance is simulated by PSIM and verified by MATLAB. By connecting the real-time digital simulator Typhoon HILS to the DSP 28377 control board, the mutual interference characteristics are tested under the condition of two inverters running in parallel. The experimental and analysis results are the same, indicating the validity of the analysis.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.57-64
• /
• 2008

The data grid computing provides geographically distributed storage resources to solve computational problems with large-scale data. Unlike cache replacement policies in virtual memory or web-caching replacement, an optimal file replacement policy for data grids is the one of the important problems by the fact that file size is very large. The traditional file replacement policies such as LRU(Least Recently Used), LCB-K(Least Cost Beneficial based on K), EBR(Economic-based cache replacement), LVCT(Least Value-based on Caching Time) have the problem that they have to predict requests or need additional resources to file replacement. To solve theses problems, this paper propose SBR-k(Sized-based replacement-k) that replaces files based on file size. The proposed policy considers file size to reduce the number of files corresponding to a requested file rather than forecasting the uncertain future for replacement. The results of the simulation show that hit ratio was similar when the cache size was small, but the proposed policy was superior to traditional policies when the cache size was large.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.