• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.4
• /
• pp.59-70
• /
• 2003

Spatial data base system provides many query types and most of them are required frequent disk I/O and much CPU time. k-NN search is to find k-th closest object from the query point and up to now, several k-NN search methods have been proposed. Among these, MINMAX distance method has an aim not to access unnecessary node by adapting pruning technique. But this method accesses more disks than necessary while pruning unnecessary nodes. In this paper, we propose new k-NN search algorithm based on density of object. With this method, we predict the radius to be expected to contain k-NN objects using density of data set and search those objects within this radius and then adjust radius if failed. Experimental results show that this method outperforms the previous MINMAX distance method. This algorithm visit less disks than MINMAX method by the factor of maximum 22% and average 7%.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.1
• /
• pp.1-8
• /
• 2020

If a dangerous situation arises in a place where out of reach from the human, UAVs can be used to determine the size and location of the situation to reduce the further damage. With this in mind, this paper sets the minimum value of the roll, pitch, and yaw using beta flight to detect the UAV's smooth hovering, integration, and derivative (PID) values to ensure that the UAV stays horizontal, minimizing errors for safe hovering, and the camera uses Open CV to install the Raspberry Pi program and then HSV (color, saturation, Brightness) using the color palette, the filter is black and white except for the red color, which is the closest to the fire we want, so that the UAV detects the image in the air in real time. Finally, it was confirmed that hovering was possible at a height of 0.5 to 5m, and red color recognition was possible at a distance of 5cm and at a distance of 5m.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.596-600
• /
• 2010

This paper proposes hough transform-based semi-automatic vertex detection algorithm for object modeling on a mobile phone supporting touch-screens. The proposed algorithm shows fast processing time by searching the limited range of parameters for computing hough transform with a small range of ROI image. Moreover, the proposed algorithm removes bad candidates among the detected lines by selecting the two closest candidate lines from the position of user's input. After that, it accurately detects an interesting vertex without additionally required interactions by detecting an intersection point of the two lines. As a result, we believe that the proposed algorithm shows a 1.4 pixel distance error on average as a vertex detection accuracy under such conditions as a 5.7 pixel distance error on average as an inaccurate input.

• Journal of Advanced Navigation Technology
• /
• v.24 no.2
• /
• pp.128-133
• /
• 2020

In this study, an 1-dimensional positioning method using iterative linear regression for path loss expression is proposed. In the proposed method, received signal strengths (RSS) measured in several locations and distances between the measuring locat ions obtained by dead reckoning are used to derive a linear regression for the path loss from the transmitting beacon. In the proposed method, for the distance between the transmitting beacon and a target measuring location, several tentative values are assumed. For each tentative value, a linear regression is obtained. Among the linear regression expressions, the one closest to the known reference RSS value is selected and used to derive the distance to the target location. Test results show that the proposed method is more accurate than path loss model.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.75-80
• /
• 2004

An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.9
• /
• pp.818-826
• /
• 2012

In this paper, the improvement methods of the computational efficiency of the conjunction screening algorithm, which calculates the closest distance between primary satellite and space objects are presented. First method is to use GPU(Graphics Processing Unit) that has high computing power and handles quickly large amounts of data. Second method is to use Apogee/Perigee filter which excludes non-threatening objects that have low probability of collision and/or minimum distance rather than that of thresh hold. Third method is to combine first method with second method. As a result, the computational efficiency has been improved 34 times and 3 times for the first method only and second method only, respectively. On the contrary, the computational efficiency has been dramatically improved 163 times when two kinds of methods are combined.

• The Journal of Engineering Geology
• /
• v.17 no.3
• /
• pp.405-409
• /
• 2007

There exist 5 wells drilled at the Yecheon hot spring area, the distance between the wells is about $159m{\sim}702.6m$. The safe yield of each well is controlled by interference drawdown between a pumping well and an observation well after pumping test. The well No. 2 and the well No. 5 are the closest, at the distance of 159 m; therefore interference drawdown between two wells was occurred considerably. The drawdown of the well No. 2 (an observation well) was 16.67 m; the drawdown of the well No. 5 (a pumping well) was 17.21 m. The degree of the interference is about 97% and the safe yield decreased from $750m^3/day\;to\;24m^3/day$. Significant interference between two wells is due to the fact that the aquifer has 1.5 dimensions.

• The Korean Journal of Zoology
• /
• v.38 no.4
• /
• pp.443-448
• /
• 1995

Playback experiments were performed to clarify the degree of song recognition using inter - and intra-populatlon songs of Bush Warbler at Cheongwon, Chungbuk area. Six territorial males were strongly responded to inter- as well as intrapopulation songs. Their responses to the inter- and Intra-population songs were not differed significantly in all measures of latency time, staying time, and closest distance. This result imply that Bush Warbiers in the region did not discriminate the difference between intra- and inter-population songs. It may be the reason that the regional males have little Interactions In song exchange with neighbors by keeping a long Individual distance. In order to investigate the signal value as species recognition releaser, playback of partial songs, prepared from tow distinct regional populations of the spedes were presented to males of the study area. The partial songs presented were made of two portions for each presentation, a whlsde portion only, and a complex syllable portion only. Territorial males responded stronger to the complex syllable portion than the whistle portion of the song. This result indicate that the complex syllable portion conveys more information on the species recognition. As 'releaser' hypothesis suggested formerly, a function of the complex syllable portion In Bush Warbler song is understood In which conveys most spedesIdentifying information. Thus, the result of this playback experiments supports the releaser hypothesis.

• Land and Housing Review
• /
• v.11 no.1
• /
• pp.109-116
• /
• 2020

This study aims to establish an approach to assess urban flood vulnerability by identifying social characteristics such as the road transportation and the vulnerable groups. Assessment procedures comprise three steps as: (1) composing the assessment criteria to reflect the urban characteristics; (2) calculating the weight; and (3) evaluating the vulnerability. The criteria were adopted by Delphi survey technique. Four criteria as land cover, residents, vulnerable areas, and disaster response were adopted in the current study. To determine the weight set of criteria, subjective and objective methods were combined. The weight set was determined using the combined method which reflects the Delphi method and Entropy analysis. In the process of data-based construction, GIS tools wwere used to extract administrative unit materials such as land cover, road status, and slope. Data on population and other social criteria were collected through the National Statistical Office and the Seoul Metropolitan statistical data. TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) technique, which uses materials from cell units in order to rank the closest distance to the best case and the farthest distance from the worst case by calculating the distances to the area of assessment, was applied to assess. The study area was the Dorimcheon basin, a flood special treatment area of Seoul city. The results from the current study indicates that the established urban flood vulnerability assessment approach is able to predict the inherent vulnerable factors in urban regions and to propose the area of priority control.

• Asian-Australasian Journal of Animal Sciences
• /
• v.16 no.2
• /
• pp.277-281
• /
• 2003

Amplified fragment length polymorphism (AFLPs) markers were used to investigate the genetic variation in six autochthonous goat populations distributed in the middle and lower Yangtze River valley. The goat populations were Chengdu Grey Goat (CGG), Chuandong White Goat (CWG), Banjiao Goat (BG), Matou Goat (MG), Hui Goat (HG) and Yangtze River Delta White Goat (YRDWG). A total of 180 individuals (30 per population) were analysed using ten selected AFLP primer combinations that produced 78 clear polymorphism loci. The variability at AFLP loci was largely maintained within populations, as indicated by the average genetic similarity, and they were ranged from 0.745 to 0.758 within populations and 0.951 to 0.970 between populations. No breed specific markers were identified. Cluster analysis based on Nei' genetic distance between populations indicated that Chengdu Grey Goat is the most distant population, while CWG and YROWG were the closest populations, followed by BG, HG and MG. Genetic diversity of the goat populations didn' confirm what was expected on the basis of their geographical location, which may reflect undocumented migrations and gene flows and identify an original genetic resource.