• International journal of advanced smart convergence
• /
• v.12 no.1
• /
• pp.1-8
• /
• 2023

Smart IoT over high speed network and high performance smart devices explodes the ubiquitous services and applications. Nearest Neighbor(NN) query is one of the important type of queries that have to be supported for ubiquitous information services. In order to process efficiently NN queries in the wireless broadcast environment, it is important that the clients determine quickly the search space and filter out NN from the candidates containing the search space. In this paper, we propose a hybrid index of Voronoi and grid partition to provide quick search space decision and rapid filtering out NN from the candidates. Grid partition plays the role of helping quick search space decision and Voronoi partition providing the rapid filtering. We show the effectiveness of the proposed index by comparing the existing indexing schemes in the access time and tuning time. The evaluation shows the proposed index scheme makes the two performance parameters improved than the existing schemes.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.1025-1034
• /
• 2008

In this paper, we developed GridGML for efficiently supplying a GML and visualizing the map with partitioning map and caching method to a mobile device. In order to overcome the weighting of a file, which is the biggest weakness of a GML, GridGML extracts only the most necessary parts for the visualization of the map among GML attributes, and makes the file light as a class instance by applying an offset value. GridGML manages a partition based on the visualization area of a mobile device to visualize the map to a mobile device in real time, and transmits the partition area by serializing it for the benefit of transmission. Also, the received partition area is compounded in a mobile device and is visualized by being partitioned again as four visible areas based on the display of a mobile device. Then, the area is managed by applying a caching algorithm in consideration of repetitiveness for a received map for the efficient operation of resources. Also, in order to prevent the delay in transmission time as regards the instance density area of the map, an adaptive map partition mechanism is proposed for maintaining the transmission time uniformly.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.433-439
• /
• 1998

In this paper, we present an approach to the structure identification based on the input space partition methods and to the parameter identification by hybrid learning method in neuro-fuzzy system. The structure identification can automatically estimate the number of membership function and fuzzy rule using grid partition, tree partition, scatter partition from numerical input-output data. And then the parameter identification is carried out by the hybrid learning scheme using back-propagation and least squares estimate. Finally, we sill show its usefulness for neuro-fuzzy modeling to truck backer-upper control.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2072-2078
• /
• 2011

In photovoltaic(PV) system, for obtaining maximum efficiency of solar power systems, the solar tracking system must be controlled to match position of the sun. In this paper, we design the solar tracking system to track movement of the sun using CdS sensor modules and to determine direction of the sun under shadow of directions. In addition, for an intelligent computation in tracking of the sun, a fuzzy controller is allocated to space avaliable for splitting area of fuzzy part for the fuzzy input space(grid-type fuzzy partition) in which a fuzzy grid partition divides fuzzy rules bases. As well, a simple model of solar tracking system is designed by two-axis motor control systems and the 8-direction sensor module that can measure shadow from CdS sensor modules by matching of axis of CdS modules and PV panels. We demonstrate this systems is effective for fixed location and moving vessels and our fuzzy controller can track the satisfactorily.

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

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.494-498
• /
• 1996

Three fuzzy input space partitoining methods, which are grid, tree, and scatter method, are mainly used until now. These partition methods represent good performance in the modeling of the linear system and nonlinear system with independent modeling variables. But in the case of the nonlinear system with the coupled modeling variables, there should be many fuzzy rules for acquiring the exact fuzzy model. In this paper, it shows that the fuzzy model is acquired using transformed modeling vector by linear transformation of the modeling vector.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.28 no.3
• /
• pp.97-104
• /
• 2000

Studies on the principle of traditional moulding techniques of architecture or structure are very important in the point of the work could accomplish succession to modern design. As an attempt of these work, this study tried to examine traditional moulding techniques applied in planes of ancient architecture and structure closely. The major findings of this study are summarized as follows; It was verified that planes of ancient Korean architectures and structures analyzed in this study was moulded by its multiple partitions with the six or eight partitions of circumference as the fundamental form. The well unearthed in kyong-bok palace recently was moulded by a concentric circle assumed form of 4 circle which was extended with equal interval and divided into multiple of 8 partition of circumference. Chon-duk-jung in chang-duk palace also was moulded by a concentric circle assumed form of 3 circle extended with equal interval, but circle were divide by 6 partitions. It was also found that 6$^{\circ}$§8 partitions of circumference(or its multiple partition) was applied to not only above structures but also the moulding planes of ancient architecture, and as a results, figures revealed in architectures analyzed is classified into three classes. And, this study analyzed arrangements of two temples. As a results, it is discovered that the Grid used in moulding planes of each building fixed the arrangement of buildings. Therefore, moulding by equal partition of circumference decided the form of each building and the relation of element at the same time.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5042-5048
• /
• 2010

In ubiquitous environments, many continuous query processing techniques make use of operator network and sharing methods on continuous data stream generated from various sensors. Since similar continuous queries with the location information intensively occur in specific regions, we suggest a new operator sharing method based on grid partition for the spatial continuous query processing for location-based applications. Due to the proposed method shares moving objects by the given grid cell without sharing spatial operators individually, our approach can not only share spatial operators including similar conditions, but also increase the query processing performance and the utilization of memory by reducing the frequency of use of spatial operators.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.5 s.98
• /
• pp.48-57
• /
• 1999

Applications of thresholding technique are based on the assumption that object and background pixels in a digital image can be distinguished by their gray level values. For the segmentation of more complex images, it is necessary to resort to multiple threshold selection techniques. This paper describes a new method for multiple threshold selection of gray level images which are not clearly distinguishable from the background. The proposed method consists of three main stages. In the first stage, a probability distribution function for a gray level histogram of an image is derived. Cluster points are defined according to the probability distribution function. In the second stage, fuzzy partition matrix of the probability distribution function is generated through the fuzzy clustering process. Finally, elements of the fuzzy partition matrix are classified as clusters according to gray level values by using max-membership method. Boundary values of classified clusters are selected as multiple threshold. In order to verify the performance of the developed algorithm, automatic inspection process of ball grid array is presented.