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

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.1133-1137
• /
• 1995

This paper presents a numerical method of the global search for an optimal geometric path for a manipulator arm amid obstacles. Finite term quintic B-splines are used to describe an arbitrary point-to-point manipulator motion with fixed moving time. The coefficients of the splines span a linear vector space, a point in which uniquely represents the manipulator motion. All feasible geometric paths are searched by adjusting the seed points of the obstacle models in the penetration growth distances. In the numerical implementation using nonlinear programming, the globally optimal geometric path is obtained for a spatial 3-link(3-revolute joints) manipulator amid several hexahedral obstacles without simplifying any dynamic or geometric models.

• YAKHAK HOEJI
• /
• v.41 no.3
• /
• pp.298-304
• /
• 1997

Molecular mechanics and conformation search methods were carried oyt to investigate the relationship between conformations and thromboxane synthetase ingibitory activities of om ega-pyridylalkenoic acids. The initial geometries of ${\omega}$-pyridylalkenoic acids and heme part of cytochrome P-450 were obtained from MM+ geometry optimization. The bond lenths and angles were not varied by step during the conformation searching. Stable conformers of some ${\omega}$-pyridylalkenoic acids were obtained by comformational search method. The distances were 8.5~10.8 ${\AA}$- between N atom at 3-position of pyridine ring and C atom at carboxylic group of stable ${\omega}$-pyridylalkenoic acids. The conformations of ${\omega}$-pyridylalkenoic acids and heme part complex were determined by same method. In theses structures, benzene ring and ethylene group in ${\omega}$-pyridylalkenoic acids are making the structure more rigid and increase inhbitory activity. The electron donating groups in C atom shich is connected to pyridine ring also increase activity.

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

This paper presents a method of landmark recognition in indoor environments using a neural-network for an autonomous mobile robot. In order to adapt to image deformation of a landmark resulted from variations of view-points and distances, a multi-labeled template matching(MLTM) method and a dynamic area search method(DASM) are proposed. The MLTM is. used for matching an image template with deformed real images and the DASM is proposed to detect correct feature points among incorrect feature points. Finally a feed-forward neural-network using back-propagation algorithm is adopted for recognizing the landmark.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.138-148
• /
• 1998

The aim of the work described in this paper is to develop a complex underground acoustic system which detects and localizes the origin of an underground hammering sound using an array of hydrophones located about loom underground. Three different methods for the sound localization will be presented, a time-delay method, a power-attenuation method and a hybrid method. In the time-delay method, the cross correlation of the signals received from the way of sensors is used to calculate the time delays between those signals. In the power-attenuation method, the powers of the received signals provide a measure of the distances of the source from the sensors. A new hybrid method has been developed for estimating the origin of the underground acoustic source by coupling both methods. The Nelder-Meade simplex search algorithm is then used to numerically estimate the position of the source in those methods. For each method the sound localization is carried out in three dimensions underground. The distance between the true and estimated origins of the source is in some cases less than 6m for a search area of radius 250m.

• Journal of Advanced Navigation Technology
• /
• v.13 no.5
• /
• pp.646-655
• /
• 2009

This paper presents a new search strategy based on models of evolution in order to solve the problem of collision-free robotic path planning. We designed the robot path planning method with genetic algorithm which has become a well-known technique for optimization, intelligent search. Considering the path points as genes in a chromosome will provide a number of possible solutions on a given map. In this case, path distances that each chromosome creates can be regarded as a fitness measure for the corresponding chromosome. The effectiveness of the proposed genetic algorithm in the path planning was demonstrated by simulation. The proposed search strategy is able to use multiple and static obstacles.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.4
• /
• pp.16-22
• /
• 2021

We search for an appropriate initial adsorption coordination of precursor on surface by using genetic algorithm (GA) and density functional theory. SiH₄ and Al(CH₃)₃ as precursor, and OH-terminated Si (001) as surface are used for this study. Selection, crossover, and mutation as hyperparameters of GA are applied to search for the adsorption coordination of the precursors on the surface as a function of generation. Bond distances between precursors and the surface are used to explain the adsorption behavior of the precursors.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.209-219
• /
• 2004

In order to implement a real time hardware for keyword spotting, we propose a Single-End-Point DTW(SEP-DTW) algorithm which is simple and less complex for computation. The SEP-DTW algorithm only needs a single end point which enables efficient applications, and it has a small wont of computations because the global search area is divided into successive local search areas. Also, we adopt new local constraints and a new distance measure for a better performance of the SEP-DTW algorithm. Besides, we make a normalization of feature same vectors so that they have the same variance in each frequency bin, and each frame has the same energy levels. To construct several reference patterns for each keyword, we use a clustering algorithm for all training patterns, and mean vectors in every cluster are taken as reference patterns. In order to detect a key word for input streams of speech, we measure the distances between reference patterns and input pattern, and we make a decision whether the distances are smaller than a pre-defined threshold value. With isolated speech recognition and keyword spotting experiments, we verify that the proposed algorithm has a better performance than other methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.112-114
• /
• 2011

On multimedia databases, in order to realize the fast access method, indexing methods for the multidimension data space are used. However, since it is a premise to use the Euclid distance as the distance measure, this method lacks in flexibility. On the other hand, there are metric indexing methods which require only to satisfy distance axiom. Since metric indexing methods can also apply for distance measures other than the Euclid distance, these methods have high flexibility. This paper proposes an improved method of VP-tree which is one of the metric indexing methods. VP-tree follows the node which suits the search range from a route node at searching. And distances between a query and all objects linked from the leaf node which finally arrived are computed, and it investigates whether each object is contained in the search range. However, search speed will become slow if the number of distance calculations in a leaf node increases. Therefore, we paid attention to the candidates selection method using the triangular inequality in a leaf node. As the improved methods, we propose a method to use the nearest neighbor object point for the query as the datum point of the triangular inequality. It becomes possible to make the search range smaller and to cut down the number of times of distance calculation by these improved methods. From evaluation experiments using 10,000 image data, it was found that our proposed method could cut 5%~12% of search time of the traditional method.

• Nuclear Engineering and Technology
• /
• v.52 no.7
• /
• pp.1524-1531
• /
• 2020

The aim of this work is to develop a Geiger-Muller (GM) detector system for robot to look for a radioactive source in case of a nuclear emergency or in a high radiation environment. In order to find a radiation source easily, a detector system, including 3 detectors, was designed to search γ-ray radiation sources autonomously. First, based on GEANT4 simulation, radiation dose rates in 3 Geiger-Muller (GM) counters were simulated at different source-detector distances, distances between detectors and angles. Various sensitivity analyses were performed experimentally to verify the simulated designed detector system. A mono-energetic ¹³⁷Cs γ-ray source with energy 662 keV and activity of 1.11 GBq was used for the observation. The simulated results were compared with the experimental dose rate values and good agreements were obtained for various cases. Only based on the dose rates in three detectors, the radiation source with a specific source activity and angle was localized in the different location. A method was adopted with the measured dose rates and differences of distances to find the actual location of the lost γ-ray source. The corresponding angles of deviation and detection limits were calculated to determine the sensitivity and abilities of our designed detector system. The proposed system can be used to locate radiation sources in low and high radiation environments.