• Journal of the Korean Data and Information Science Society
• /
• v.21 no.1
• /
• pp.121-128
• /
• 2010

K-means clustering is an iterative algorithm in which items are moved among sets of clusters until the desired set is reached. K-means clustering has been widely used in many applications, such as market research, pattern analysis or recognition, image processing, etc. It can identify dense and sparse regions among data attributes or object attributes. But k-means algorithm requires many hours to get k clusters that we want, because it is more primitive, explorative. In this paper we propose a new method of k-means clustering using a center of gravity for grid-based sample. It is more fast than any traditional clustering method and maintains its accuracy.

• Current Optics and Photonics
• /
• v.5 no.4
• /
• pp.409-420
• /
• 2021

We propose a method to synthesize a color non-hogel-based computer-generated-hologram (CGH) from light field data of a three-dimensional scene with a hologram pixel pitch shared for all color channels. The non-hogel-based CGH technique generates a continuous wavefront with arbitrary carrier wave from given light field data by interpreting the ray angle in the light field to the spatial frequency of the plane wavefront. The relation between ray angle and spatial frequency is, however, dependent on the wavelength, which leads to different spatial frequency sampling grid in the light field data, resulting in color aberrations in the hologram reconstruction. The proposed method sets a hologram pixel pitch common to all color channels such that the smallest blue diffraction angle covers the field of view of the light field. Then a spatial frequency sampling grid common to all color channels is established by interpolating the light field with the spatial frequency range of the blue wavelength and the sampling interval of the red wavelength. The common hologram pixel pitch and light field spatial frequency sampling grid ensure the synthesis of a color hologram without any color aberrations in the hologram reconstructions, or any loss of information contained in the light field. The proposed method is successfully verified using color light field data of various test or natural 3D scenes.

• Journal of the Korean Society for Precision Engineering
• /
• v.30 no.3
• /
• pp.308-316
• /
• 2013

This paper proposes an observation model for a particle filter-based localization using a sonar grid map. The proposed model estimates a predicted observation by considering the properties of a sonar sensor which has a large angular uncertainty. The proposed model searches a grid which has the highest probability to reflect a sonar beam using the following procedures; (1) the reliable area of a single sonar data is determined using the footprint association model; (2) the detection probability of each grid cell in a sonar beam coverage in estimated. The proposed model was applied to the particle filter based localization, and was verified by experiments in indoor environments.

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

• Communications for Statistical Applications and Methods
• /
• v.29 no.1
• /
• pp.65-83
• /
• 2022

Although various statistical methods have been developed to map time-dependent genetic factors, most identified genetic variants can explain only a small portion of the estimated genetic variation in longitudinal traits. Gene-gene and gene-time/environment interactions are known to be important putative sources of the missing heritability. However, mapping epistatic gene-gene interactions is extremely difficult due to the very large parameter spaces for models containing such interactions. In this paper, we develop a Gaussian process (GP) based nonparametric Bayesian variable selection method for longitudinal data. It maps multiple genetic markers without restricting to pairwise interactions. Rather than modeling each main and interaction term explicitly, the GP model measures the importance of each marker, regardless of whether it is mostly due to a main effect or some interaction effect(s), via an unspecified function. To improve the flexibility of the GP model, we propose a novel grid-based method for the within-subject dependence structure. The proposed method can accurately approximate complex covariance structures. The dimension of the covariance matrix depends only on the number of fixed grid points although each subject may have different numbers of measurements at different time points. The deviance information criterion (DIC) and the Bayesian predictive information criterion (BPIC) are proposed for selecting an optimal number of grid points. To efficiently draw posterior samples, we combine a hybrid Monte Carlo method with a partially collapsed Gibbs (PCG) sampler. We apply the proposed GP model to a mouse dataset on age-related body weight.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.846-848
• /
• 2009

The interest in the access and integration of distributed massive data resources has increased recently. This paper presents the Advanced Collection Manager(CM) service with OGSA-DAI component which can access and integrate the distributed data resources. The Advanced CM service supports the data resource of various types. And it can provide the query, updating, transforming and delivering data via cooperating with other services in Grid Information Retrieval(Grid-IR or GIR) System. As a result, it can access and manage the data resource more flexible and efficient.

• Journal of Korea Water Resources Association
• /
• v.41 no.9
• /
• pp.895-905
• /
• 2008

To analyze hydrologic processes in a watershed requires both various geographical data and hydrological time series data. Recently, not only geographical data such as DEM(Digital Elevation Model) and hydrologic thematic map but also hydrological time series from numerical weather prediction and rainfall radar have been provided as grid data, and there are studies on hydrologic analysis using these grid data. In this study, GRM(Grid based Rainfall-runoff Model) which is physically-based distributed rainfall-runoff model has been developed to simulate short term rainfall-runoff process effectively using these grid data. Kinematic wave equation is used to simulate overland flow and channel flow, and Green-Ampt model is used to simulate infiltration process. Governing equation is discretized by finite volume method. TDMA(TriDiagonal Matrix Algorithm) is applied to solve systems of linear equations, and Newton-Raphson iteration method is applied to solve non-linear term. Developed model was applied to simplified hypothetical watersheds to examine model reasonability with the results from $Vflo^{TM}$. It was applied to Wicheon watershed for verification, and the applicability to real site was examined, and simulation results showed good agreement with measured hydrographs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1390-1398
• /
• 2010

We present the concept of applying Wireless Mesh Networking (WMN) technology into Smart Grid, which is recently rising as a potential technology in various areas thanks to its advantages such as low installation costs, high scalability, and high flexibility. Smart Grid is an intelligent, next-generation electrical power network that can maximize energy efficiency by monitoring utility information in real-time and controlling the flow of electricity with IT communications technology converged to the existing power grid. WMNs must be designed for Smart Grid communication systems considering not only the high level of reliability, QoS support and mass-data treatment but also the properties of the traditional power grid. In addition, it is essential to design techniques based on international standards to support interoperability and scalability. In this paper, we evaluate the performance of IEEE 802.11s based Smart Grid Mesh Networks by conducting preliminary simulation studies with the ns-3 simulator. We also outline some challenging issues that should be reviewed when considering WMNs as the candidate for Smart Grid communication infrastructure.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.1
• /
• pp.35-40
• /
• 2015

This paper presents the optimal network configuration for electric stations using HOMER software. For the given data such as annual average wind speed and grid costs, this software calculates the NPC(Net Present Cost), operating cost and COE(Cost of Energy). Based on these simulation results, it is possible to find the optimal network configuration for electric stations depending on the grid cost and average wind speed. When the rising grid cost is considered, it is essential to use grid and renewable energy together. Depending on the increase of the grid cost, NPC of the configuration using renewable energy and grid can be gradually getting smaller than NPC of the configuration using only grid.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.44-52
• /
• 2013

This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.