• 한국데이터정보과학회:학술대회논문집
• /
• 2003.10a
• /
• pp.249-258
• /
• 2003

K-means clustering has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research and so on. 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 the grid-based sample. It is more fast than any traditional clustering method and maintains its accuracy.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.05a
• /
• pp.97-108
• /
• 2003

Cluster analysis has been widely used in many applications, such that pattern analysis or recognition, data analysis, image processing, market research on on-line or off-line and so on. Clustering can identify dense and sparse regions among data attributes or object attributes. But it requires many hours to get clusters that we want, because of clustering is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new method of clustering using sample based on grid. It is more fast than any traditional clustering method and maintains its accuracy. It reduces running time by using grid-based sample. And other clustering applications can be more effective by using this methods with its original methods.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.2
• /
• pp.217-226
• /
• 2005

Cluster analysis has been widely used in many applications, such as data analysis, pattern recognition, image processing, etc. But clustering requires many hours to get clusters that we want, because it is more primitive, explorative and we make many data an object of cluster analysis. In this paper we propose a new clustering method, 'Clustering algorithm using a center of gravity for grid-based sample'. It reduces running time by using grid-based sample and keeps accuracy by using representative point, a center of gravity.

• Journal of Multimedia Information System
• /
• v.1 no.2
• /
• pp.111-118
• /
• 2014

The Smart grid refers to the technology that enables efficient usage of electric power by collecting information concerning the power usage and power lines grafting information and communications technology to onto power grids. There are Zigbee, PLC or IEEE 802.11 WLAN MAC as a core technology of the Smart grid, but in this paper, the discussion is focused on the PLC. The PLC is the technology that carries out data communications using power lines and put into practical use in the field of lights or home appliances control recently but PLC-applied communications between electronic devices are rarely seen. For the reason that the PLC uses high-voltage power lines and has a disadvantage of experiencing higher data loss rate caused by the noises produced by going through transformers, the technology is yet to be used in many areas. Nevertheless, the PLC has been studied widely recently in respect that it's the low-cost communication solution for the Smart Metering [1]. Moreover, this technology is emerging as a novel data communication method and discussed as an important technology lately due to the developments of the Smart grid systems and Internet of things (IoT). Thus, in this paper, the results obtained from designing and performing implementation scenario for the PLC-based Smart grid home network system were compared and analyzed with that of IEEE 802.11 WLAN MAC (the foundation technology at Jeju Smart grid Test bed)-based Smart grid home network. Thus, in this paper, OPNET 14.5 PL8, OSI 7 layer, PLC router nodes and PLC nodes had been used for the designing and implementation simulations of both systems. Additionally, QoS was not considered in order to guarantee that all the traffics would not have the same processing priority.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.66 no.4
• /
• pp.41-50
• /
• 2024

Precipitation is an important component of the hydrological cycle and a key input parameter for many applications in hydrology, climatology, meteorology, and weather forecasting research. Grid-based satellite rainfall products with wide spatial coverage and easy accessibility are well recognized as a supplement to ground-based observations for various hydrological applications. The error properties of satellite rainfall products vary as a function of rainfall intensity, climate region, altitude, and land surface conditions. Therefore, this study aims to evaluate the commonly used new global grid-based satellite rainfall product, Climate Hazards Group InfraRed Precipitation with Station data (CHIRPS), using data collected at different spatial and temporal scales. Additionally, in this study, grid-based CHIRPS satellite precipitation data were used to evaluate the 2022 extreme drought. CHIRPS provides high-resolution precipitation data at 5 km and offers reliable global data through the correction of ground-based observations. A frequency analysis was performed to determine the precipitation deficit in 2022. As a result of comparing droughts in 2015, 2017, and 2022, it was found that May 2022 had a drought frequency of more than 500 years. The 1-month SPI in May 2022 indicated a severe drought with an average value of -1.8, while the 3-month SPI showed a moderate drought with an average value of 0.6. The extreme drought experienced in South Korea in 2022 was evident in the 1-month SPI. Both CHIRPS precipitation data and observations from weather stations depicted similar trends. Based on these results, it is concluded that CHIRPS can be used as fundamental data for drought evaluation and monitoring in unmeasured areas of precipitation.

• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.217-223
• /
• 2022

Subspace clustering for online data streams requires a large amount of memory resources as all subsets of data dimensions must be examined. In order to track the continuous change of clusters for a data stream in a finite memory space, in this paper, we propose a grid-based subspace clustering algorithm that effectively uses memory resources. Given an n-dimensional data stream, the distribution information of data items in data space is monitored by a grid-cell list. When the frequency of data items in the grid-cell list of the first level is high and it becomes a unit grid-cell, the grid-cell list of the next level is created as a child node in order to find clusters of all possible subspaces from the grid-cell. In this way, a maximum n-level grid-cell subspace tree is constructed, and a k-dimensional subspace cluster can be found at the k^th level of the subspace grid-cell tree. Through experiments, it was confirmed that the proposed method uses computing resources more efficiently by expanding only the dense space while maintaining the same accuracy as the existing method.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.26 no.11
• /
• pp.1521-1530
• /
• 2002

This article proposes a pressure based method for predicting flows at all speeds. The compressible SIMPLE algorithm is extended to unstructured grid framework. Convection terms are discretized using second-order scheme with deferred correction approach. Diffusion term discretization is based on structured grid analogy that can be easily adopted to hybrid unstructured grid solver. This method also uses node centered scheme with edge based data structure for memory and computing time efficiency of arbitrary grid types. Both incompressible and compressible benchmark problems are solved using the above methodology. The demonstration of this method is extended to slip flow problem that has low Reynolds number but compressibility effect. It is shown that the proposed method can improve efficiency in memory usage and computing time without losing any accuracy.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.12 s.177
• /
• pp.61-69
• /
• 2005

This paper presents an efficient method of extracting line segments from the occupancy grids in a grid map. The grid map is composed of 2-D grids that have both the occupancy and orientation probabilities using sonar sensors. We evaluate the orientation information of every grid when the occupancy probability of the grid is updated from sonar range data. To find the shape of an object in the map from orientation information, the orientations are clustered into several groups according to their values. The line segments are, then, extracted from the clusters based on Hough transform. Finally, a feature-based map is built with these line segments. The proposed method is illustrated with the results produced by sets of experiments in an indoor environment.

• Journal of information and communication convergence engineering
• /
• v.8 no.5
• /
• pp.581-585
• /
• 2010

A grid was sandwiched between two cascaded imaging plates. Using a fan-beam X-ray tube and a single exposure scheme, the two imaging plates, respectively, recorded grid-less and grid type information of the object. Referring to the mathematical model of the Grid-less and grid technique, it was explained that the collected components whereas that of imaging plates with grid was of high together with large scattered components whereas that of imaging plate with grid was of low and suppressed scattered components. Based on this assumption and using a Gaussian convolution kernel representing the effect of scattering, the related data of the imaging plates were simulated by computer. These observed data were then employed in the developed post-processing estimation and restoration (kalman-filter) algorithms and accordingly, the quality of the resultant image was effectively improved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1892-1903
• /
• 2016

Mobile social network is becoming more and more popular with respect to the development and popularity of mobile devices and interpersonal sociality. As the amount of social data increases in a great deal and cloud computing techniques become developed, the architecture of mobile social network is evolved into cloud-based that mobile clients send data to the cloud and make data accessible from clients. The data in the cloud should be stored in a secure fashion to protect user privacy and restrict data sharing defined by users. Ciphertext-policy attribute-based encryption (CP-ABE) is currently considered to be a promising security solution for cloud-based mobile social network to encrypt the sensitive data. However, its ciphertext size and decryption time grow linearly with the attribute numbers in the access structure. In order to reduce the computing overhead held by the mobile devices, in this paper we propose a new Outsourcing decryption and Match-then-decrypt CP-ABE algorithm (OM-CP-ABE) which firstly outsources the computation-intensive bilinear pairing operations to a proxy, and secondly performs the decryption test on the attributes set matching access policy in ciphertexts. The experimental performance assessments show the security strength and efficiency of the proposed solution in terms of computation, communication, and storage. Also, our construction is proven to be replayable choosen-ciphertext attacks (RCCA) secure based on the decisional bilinear Diffie-Hellman (DBDH) assumption in the standard model.