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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.374-377
• /
• 2004

Existing Clustering Methods for spatial data mining process only point objects, not objects with polygonometry such as lines and areas. It is because that distance computation between objects with polygonomery for clustering is more complex than point objects. To solve this problem, we design a clustering method based on regular grid cell structures. In details, it refutes cost and time for distance computation using cell relationships in grid cell structures.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.485-489
• /
• 2003

Several clustering methods for spatial data mining have been devised in the literature, but have the following drawback: increase cost due to calculating distance among objects. To solve this problem, we propose a spatial clustering method using regular cells. In this paper, we design and implement file structures, data structures and algorithms to realize the proposed method, also, show experimental results after applying test data to the implemented method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.468-471
• /
• 2003

In this paper, experimental tests are performed to evaluate the efficiency of spatial clustering method using regular grid that is proposed in our recent research. In details, we estimate the execution time for finding clusters varying spatial objects on sample data sets with various distributions and perform experimental tests varying threshold value on a data set. We also compare the running time of cluster generating algorithm with that of cluster merging algorithm per each test.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.100-102
• /
• 2001

대부분의 공간색인 방법들은 공간객체의 분포가 균일하지 않다는 가정 하에 만들어졌다. 이 가정은 실제의 응용분야에 일반적으로 적용된다. 반면에 균등한 공간객체의 분포를 위하여 만들어진 공간색인 방법들도 몇가지 있다. 예를 들어, 고정 격자 방식의 공간색인 방법은 균등한 공간객체에 대한 색인 방법으로 매우 좋은 성능을 보이며, 색인과정이 매우 단순하다는 장점이 있다. 본 논문에서는 비균일적인 공간객체의 분포를 균일분포로 변화한 다음 고정 격자 방식의 공간색인을 적용하는 방법을 제안한다. 이 방법에 따르면, 공간효율성이 매우 증가하고, 빈 공간이 줄어들어 드는 등 공간색인의 성능이 다른 색인방법에 비하여 매우 증가하며, 색인과정이 단순하여 지는 장점을 가지고 있다.

• Korean Journal of Optics and Photonics
• /
• v.28 no.2
• /
• pp.53-58
• /
• 2017

This paper presents the design and fabrication of a planar nano-diffraction grating for an integrated miniature spectrometer module. The proposed planar nano-diffraction grating consists of nonuniform periods, to focus the reflected beams from the grating's surface, and an asymmetrical V-shaped groove profile, to provide uniform diffraction efficiency in the wavelength range from 400 to 650 nm. Also, to fabricate the nano-diffraction grating using low-cost UV-NIL technology, we analyzed the FT-IR spectrum of a uvcurable resin and optimized the conditions for the UV curing process. Then, we precisely fabricated the polymeric nano-diffraction grating within 5 nm in dimensional accuracy. The integrated spectrometer module using the fabricated polymeric planar nano-diffraction grating provides spectral resolution of 5 nm and spectral bandwidth of 250 nm. Our integrated spectrometer module using a polymeric planar nano-diffraction grating serves as a quick and easy solution for many spectrometric applications.

• Journal of Korea Water Resources Association
• /
• v.55 no.spc1
• /
• pp.1197-1210
• /
• 2022

Recently, users' complaints on drinking water quality are increasing according to emerging interest in the drinking water service issues such as pipe aging and various water quality accidents. In the case of drinking water quality complaints, not only the water pollution but also the inconvenience on the chlorine residual for disinfection are included, thus various efforts, such as rechlorination treatment, are being attempted in order to keep the chlorine concentration supplied evenly. In this research, for a more accurate water quality simulation of water distribution network, the water quality reaction coefficients were estimated, and an optimization method of chlorination/ rechlorination scheduling was proposed consideirng satisfaction of water quality standards and chlorine residual equalization. The proposed method was applied to a large-scale real water network, and various chlorination schemes were comparatively analyzed through the grid search algorithm and optimized based on the suitability and uniformity of supplied chlorine residual concentration.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.67-75
• /
• 2012

Optimal quantizers in conducting the entropy-constrained quantization for high bit rates have the lattice structure. The quantization process is simple due to the regular structure, and various quantization algorithms are proposed depending on the lattice. Such a lattice vector quantizer (VQ) can be implemented by using the sample-adaptive product quantizer (SAPQ) and its output can also be easily entropy encoded. In this paper, the entropy encoding scheme for the lattice VQ is proposed based on SAPQ, and the performance of the proposed lattice VQ, which is based on SAPQ with the entropy coder, is asymptotically compared as the rate increases. It is shown by experiment that the gain for the memoryless Gaussian source also approaches the theoretic gain for the uniform density case.

• Journal of Korea Water Resources Association
• /
• v.47 no.10
• /
• pp.959-972
• /
• 2014

In this study, a space-time rainfall grid field generation model based on multifractal theory was verified using nine flood events in the upstream watershed of Chungju dam in South Korea. For this purpose, KMA radar rainfall data sets were analyzed for the space-time multifractal characteristics. Simulated rainfall fields that represent the multifractal characteristics of observed rainfall field were reproduced using the space-time rainfall grid field generation model with log-Poisson distribution and three-dimension wavelet function. Simulated rainfall fields were applied to the S-RAT model as input data and compared with both observed rainfall fields and low-resolution rainfall field runoff. Error analyses using RMSE, RRMSE, MAE, SS, NPE and PTE indicated that the peak discharge increases about 20.03% and the time to peak decreases about 0.81%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.514-526
• /
• 2004

Microarray is a new technique for gene expression experiment, which has gained biologist's attention for recent years. This technology enables us to obtain hundreds and thousands of expression of gene or genotype at once using microarray Since it requires manual work to analyze patterns of gene expression, we want to develop an effective and automated tools to analyze microarray image. However it is difficult to analyze DNA chip images automatically due to several problems such as the variation of spot position, the irregularity of spot shape and size, and sample contamination. Especially, one of the most difficult problems in microarray analysis is the block and spot addressing, which is performed by manual or semi automated work in all the commercial tools. In this paper we propose a new algorithm to address the position of spot and block using a new concept of regular structure grid searching. In our algorithm, first we construct maximal I-regular sequences from the set of input points. Secondly we calculate the rotational angle and unit distance. Finally, we construct I-regularity graph by allowing pseudo points and then we compute the spot/block address using this graph. Experiment results showed that our algorithm is highly robust and reliable. Supplement information is available on http://jade.cs.pusan.ac.kr/~autogrid.