• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.85-88
• /
• 2009

In multimedia database systems, the nearest neighbor Query occurs frequently and requires the processing cost higher than other spatial Queries do. It needs the measurement of search distance that the number of searched nodes and the computation time in an index can be minimized for optimizing the cost of processing the nearest neighbor query. The circular location property of objects is considered to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we propose the processing method of nearest neighbor queries be considered a circular location property of object where the search space consists of a circular domain and show its characteristics. The proposed method uses the circular minimum distance and the circular optimal distance, the search measurement for optimizing the processing cost of nearest neighbor queries.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1077-1088
• /
• 2003

To increase the retrieval performance in spatial database systems, it is required to develop spatial indexing methods considered the spatial locality. The spatial locality is related to the location property of objects. The previous spatial indexing methods are not considered the circular location property that objects will be taken. In this paper, we propose a dynamic spatial index structure called $Cr^*$-tree, and evaluate the performance of the proposed index structure. This is a new spatial index structure considered the circular location property of objects in which a search space is constructed with the circular and linear domains. By the simulation results, the $Cr^*$-tree shows that the number of disk across is low and the bucket utilization is high regardless of object distribution and bucket capacity.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.83-90
• /
• 2010

The number of searched nodes and the computation time in an index should be minimized for optimizing the processing cost of the nearest neighbor query. The Measurement of search distance considered a circular location property of objects is required to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we propose the processing method of the nearest neighbor query be considered a circular location property of object where the search space consists of a circular domain and show its performance by experiments. The proposed method uses the circular minimum distance and the circular optimal distance which are the search measurements for optimizing the processing cost of the nearest neighbor query.

• Spatial Information Research
• /
• v.20 no.2
• /
• pp.165-172
• /
• 2012

The query of the K closest object pairs between two object sets frequently occurs at recently retrieval systems. The circular location property of objects should be considered for efficiently process queries finding such a K nearest object pair. In this paper, we propose the optimal algorithm finding the K object pairs which are closest to each other in a search space with a circular domain and show its performance by experiments. The proposed algorithm optimizes the cost of finding the K nearest object pairs by using the circular search distances which is much applied the circular location property.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.197-204
• /
• 2001

In order to increase the performance of spatial database systems, a spatial indexing method is necessary to manage spatial objects efficiently in both dynamic and static environments. A spatial indexing method considering a spatial locality is required to increase the retrieval performance. And the spatial locality is related to the location property of objects. The previous spatial indexing methods did not consider the circular location property of objects. In this paper, we introduce the CR-Tree that is a spatial index structure for clustering spatially adjacent objects in which a search space is constructed with the circular and linear domains. Using a spatial index structure considered a circular location property of objects, we show that high hit ratio and bucket utilization are increased through the simulation.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.3
• /
• pp.129-135
• /
• 2011

An algorithm is presented for estimating the 3-D location (i.e., azimuth angle, elevation angle, and range) of multiple sources with a uniform circular array (UCA) consisting of an even number of sensors. Recently the rank reduction (RARE) algorithm for partly-calibrated sensor arrays was developed. This algorithm is applicable to sensor arrays consisting of several identically oriented and calibrated linear subarrays. Assuming that a UCA consists of M sensors, it can be divided into M/2 identical linear subarrays composed of two facing sensors. Based on the structure of the subarrays, the steering vectors are decomposed into two parts: range-independent 2-D direction-of-arrival (DOA) parameters, and range-relevant 3-D location parameters. Using this property we can estimate range-independent 2-D DOAs by using the RARE algorithm. Once the 2-D DOAs are available, range estimation can be obtained for each source by defining the 1-D MUSIC spectrum. Despite its low computational complexity, the proposed algorithm can provide an estimation performance almost comparable to that of the 3-D MUSIC benchmark estimator.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.967-973
• /
• 1995

A neutral particle beam(NPB) aimed at the object and receive a small number of neutron signals at the detector to estimate the mass of an object Since there is uncertainty about the location of the axis of the beam relative to the object, we could have aiming errors which may lead to incorrect information about the object. Under the two assumptions that neutral particle scattering distribution and aiming errors have a circular normal distribution respectively, we have derived an exact probability distribution of neutral particles. It becomes a Poison-power function distribution., We proved monotone likelihood ratio property of tlis distribution. This property can be used to find a criteria for the hypothesis testing problem.

• The Journal of Engineering Geology
• /
• v.27 no.3
• /
• pp.267-274
• /
• 2017

Behavior of rock mass depend on the mechanical properties of intact rock and geometrical property of discontinuity distributed in rock mass. In case of rock slope, particularly, location of slope failure surface and behavior after failure are changed due to discontinuities. In this study, two 3D slope stability analysis methods were developed for two different failure types which are circular failure and planar failure, considering that failure type of rock slope is dependent on scale of discontinuity which was then applied to real rock slope to review the applicability. In case of circular failure, stable condition was maintained in natural dry condition, which however became unstable when the moisture content of the surface was increased by rainfall. In case of planar failure, rock slope become more unstable comparing to dry condition which is attributable to decrease in friction angle of discontinuity surface due to rainfall. Viewing analysis result above, analysis method proved to have well incorporated the phenomenon occurred on real slope from the analysis result, demonstrating its applicability to reviewing the slope stability as well as to maintaining the slope.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.5
• /
• pp.475-485
• /
• 2010

This paper proposes a novel concept for a microstrip resonator that can function as a filter and as an antenna at the same time. The proposed structure consists of an outer ring, an open loop-type inner ring, a circular patch, and three ports. The frequencies where the proposed structure works as a filter and as an antenna, respectively, are determined primarily by the radius of the inner ring and the circular patch. The measured results show that, when the microstrip resonator operates as a filtering device, this filter has about 15.1 % bandwidth at the center frequency of 0.63 GHz and a minimum insertion loss of 1.5 dB within passband. There are three transmission zeros at 0.52 GHz, 1.14 GHz, and 2.22 GHz. In the upper stopband, cross coupling - taking place at the stub of the outer ring - and the open loop-type inner ring produce one transmission zero each. The circular patch generates the dual-mode property of the filter and another transmission zero, whose location can be easily adjusted by altering the size of the circular patch. The proposed structure works as an antenna at 2.7 GHz, showing a gain of 3.8 dBi. Compared to a conventional patch antenna, the proposed structure has a similar antenna gain. At the resonant frequencies of the filter and the antenna, high isolation(less than -25 dB) between the filter port and the antenna port can be obtained.

• Journal of Mechanical Science and Technology
• /
• v.18 no.1
• /
• pp.92-105
• /
• 2004

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.