• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2003년도 추계학술대회
• /
• 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년도 춘계학술대회
• /
• 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.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 한국지진공학회 2002년도 추계 학술발표회 논문집
• /
• pp.51-60
• /
• 2002

In this study we developed the visualization scheme of spatial ground-motion measurements in real time by using DSS data. Even though this scheme itself is useful for national earthquake mitigation plans, this scheme could be served as the crucial core for constructing rapid earthquake damage evaluation system. DSS is the abbreviation of Data Subscription Service and this is the pre-assigned request for the seismic stations to send very limited brief data with high priority and negligible transmission load. In addition to visualize the damage area with intensity, the corresponding epicenter can be estimated roughly for quick event alarm. For the interpolation of spatially irregular PGA data, the program, named as surface. of GMT was used with NetCDF grid file format. Since the grid file is similar to a postscript file, the program, called as shading, was coded with C language by using Matpak library in order to convert grid files into image files.

• Journal of the Korean Data and Information Science Society
• /
• 제16권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 the Korean Data and Information Science Society
• /
• 제26권5호
• /
• pp.1035-1045
• /
• 2015

Recent studies in Big Data Analysis are showing promising results, utilizing the main memory for rapid data processing. In-memory computing technology can be highly advantageous when used with high-performing servers having tens of gigabytes of RAM with multi-core processors. The constraint in network in these infrastructure can be lessen by combining in-memory technology with distributed parallel processing. This paper discusses the research in the aforementioned concept applying to a test taxi hailing application without disregard to its underlying RDBMS structure. The application of IMDG technology in the application's backend API without restructuring the database schema yields 6 to 9 times increase in performance in data processing and throughput. Specifically, the change in throughput is very small even with increase in data load processing.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• 제51권12호
• /
• pp.577-582
• /
• 2002

The objective of this paper is to produce a weighted graph map for path-planning of an autonomous mobile robot(AMR) based on the measurements from a single ultrasonic sensor, which are acquired when the autonomous mobile robot explores unknown indoor circumstance. The AMR navigates in th unknown space by following the wall and gathers the range data using the ultrasonic sensor, from which the occupancy grid map is constructed by associating the range data with occupancy certainties. Then, the occupancy grid map is converted to a weighted graph map suing morphological image processing and thinning algorithms. the path- planning for autonomous navigation of a mobile robot can be carried out based on the occupancy grid map. These procedures are implemented and tested using an AMR, and primary results are presented in this paper.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제61권8호
• /
• pp.1186-1192
• /
• 2012

In Jeju Smart Grid field test, Zigbee technology is being used as one of customer side solutions for AMI. Although Zigbee networks that provides effective connectivity and control among devices are advantages in ease of implementation and use, the data can be exposed to cyber attacks such as eavesdrop, unauthorized data dissemination and forgery. Currently authentication and confidentiality services are provided with the network and link keys generated based on public key pairs that are pre-installed in offline. However, the network is vulnerable once a hacker intrudes into a local network because operation and management policies for the generated keys are not well-established yet. In this paper, the vulnerability of the Zigbee security system in the customer side environment of Jeju Smart Grid field test is analyzed. Then, two-way authentication with the unique identifiers of devices and user-specific group management policies are proposed to resolve the vulnerability.

• Korean Journal of Computational Design and Engineering
• /
• 제1권1호
• /
• pp.56-64
• /
• 1996

A quadrilateral-triangular mixed grid method for the solution of incompressible viscous flow is presented. The solution domain near the body surface is meshed using elliptic grid geneator to acculately simulate the viscous flow. On the other hand, we used unstructured triangular grid system generated by advancing front technique of a simple automatic grid generation algorithm in the rest of the computational domain. The present method thus is capable of not only handling complex geometries but providing accurate solutions near body surface. The numerical technique adopted here is PISO type finite element method which was developed by the present author. Investigations have been made of two-dimensional unsteady flow of Re=550 past a circular cylinder. In the case of use of the unstructured grid only, there exists a considerable amount of difference with the existing results in drag coefficient and vorticity at the cylinder surface; this may be because of the lack of the grid clustering to the surface that is a inevitable requirement to resolve the viscous flow. However, numerical results on the mixed grid show good agreements with the earlier computations and experimental data.

• Journal of Korea Multimedia Society
• /
• 제9권9호
• /
• pp.1107-1117
• /
• 2006

In this paper, a load balancing method using ring network structure in the Grid database is proposed. In the Grid database, generally, data is replicated for performance and availability. And, user's request is transferred to node and processed in that node which has target data. But, in such environment, a decline of performance can be occurred because unbalanced workload. A traditional research is proposed to solve unbalanced load problem. However, the Grid database has a number of systems and user's request always changes dynamically. Therefore, a traditional research can not be applied. The proposed method connects each node which has a same replicated data through ing network structure. If workload is overflowed in some node, user's request is transferred to a linked node which has a target data. And, this node stops another request processing until workload is decreased. Then, it changes the link structure through sending a message to a previous node, to stop request forwarding from a previous node. This paper shows a proposed method increases performance than existing research through performance evaluation and is more suitable for a complex and dynamic environment.

• Korean Journal of Remote Sensing
• /
• 제39권5_2호
• /
• pp.771-783
• /
• 2023

This study aims to compare the performance of each machine learning model for preparing a grid-based disaster risk map related to flooding in Jung-gu, Ulsan, for Typhoon Chaba which occurred in 2016. Dynamic data such as rainfall and river height, and static data such as building, population, and land cover data were used to conduct a risk analysis of flooding disasters. The data were constructed as 10 m-sized grid data based on the national point number, and a sample dataset was constructed using the risk value calculated for each grid as a dependent variable and the value of five influencing factors as an independent variable. The total number of sample datasets is 15,910, and the training, verification, and test datasets are randomly extracted at a 6:2:2 ratio to build a machine-learning model. Machine learning used random forest (RF), support vector machine (SVM), and k-nearest neighbor (KNN) techniques, and prediction accuracy by the model was found to be excellent in the order of SVM (91.05%), RF (83.08%), and KNN (76.52%). As a result of deriving the priority of influencing factors through the RF model, it was confirmed that rainfall and river water levels greatly influenced the risk.