• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1044-1049
• /
• 2000

In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has faster searching speed than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect searching time and searching precision. In this study, the whole moving pictures were primarily retrieved by the temporal sampling method. When there exist a scene change within the sampling interval, we suggested a fast searching algorithm using binary searching and derived an equation formula to determine optimal primary retrieval which can minimize computation, and showed the result of the experiment on MPEG moving pictures. The result of the experiment shows that the searching speed of the suggested algorithm is maximum 13 times faster than the one of he sequential searching method.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.1
• /
• pp.18-23
• /
• 2009

It is hard to find an operation case using anti-submarine searching pattern(ASSP) developed by Korean navy since Korean navy has begun submarine searching operation. This paper proposes the method to develop hull mount sonar(HMS) based optimal submarine searching pattern by using genetic algorithm. Developing the efficient ASSP based on theory in near sea environment has been demanded for a long time. Submarine searching operation can be executed by using ma ulti-step and multi-layed method. however, In this paper, we propose only HMS based ASSP generation method considering the ocean environment and submarine searching tactics as a step of first research. The genetic algorithm, known as a global opination method, optimizes the parameters affecting efficiency of submarine searching operation. Finally, we confirm the performance of the proposed ASSP by simulation.

• Journal of the Society of Disaster Information
• /
• v.1 no.1
• /
• pp.121-136
• /
• 2005

Most human-error case of accident database is written by various description and expression because accident database is produced by two or more person. And extracted information by searching of database varies in researcher's judgment criteria and the capability. Furthermore, much time and effort are required to examine manually information related to the human error from each accident case. Accordingly, it is difficult to explore objectively the accidents relevant to the human-error from the accident data base which is accumulated enormously. In this study, to solve these problems, it was developed an searchig method which is not influenced by researcher's judgment criteria and capability. For this, human-error keywords were extracted from a Japanese-English dictionary to examine objectively the accident case related to human-error in data base. This searching method by the human-error keywords can be applicable in most accident databases, although a database will be accumulated in future. Also, using the searching technique of this research, knowledge obtained by searching result can be compared with other research's results by the same method. Although the number of accident case increasese, searching results from database have the objectivity because it is not necessary to modify the based searching method or change the human-error keywords. However, as subject of future investigation, it would be necessary that the extension and investigation on human-error keywords improve and the technique to enhance searching accuracy would be modified.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1049-1062
• /
• 2004

With the popularization of a World Wide Web (WWW), the quantity of web information has been increased. Therefore, an efficient searching system is needed to offer the exact result of diverse Information to user. Due to this reason, it is important to extract and analysis of user requirements in the distributed information environment. The conventional searching method used the only keyword for the web searching. However, the searching method proposed in this paper adds the context information of keyword for the effective searching. In addition, this searching method extracts keywords by the new keyword extraction method proposed in this paper and it executes the web searching based on a keyword mining profile generated by the extracted keywords. Unlike the conventional searching method which searched for information by a representative word, this searching method proposed in this paper is much more efficient and exact. This is because this searching method proposed in this paper is searched by the example based query included content information as well as a representative word. Moreover, this searching method makes a domain keyword list in order to perform search quietly. The domain keyword is a representative word of a special domain. The performance of the proposed algorithm is analyzed by a series of experiments to identify its various characteristic.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.111-113
• /
• 2006

DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.5
• /
• pp.439-444
• /
• 2009

This paper presents an efficient contact detection algorithm for the plane elastostatic contact problem of the boundary element method(BEM). The data structures of the boundary element method are dissected to develop an efficient contact detection algorithm. This algorithm is consists of three parts as global searching, local searching and contact relation setting to reflect the corner node problem. Contact master and slave type elements are used in global searching step and quad-tree is selected as the spatial decomposition method in local searching step. To set up contact relation equations, global contact searching is conducted at node level and local searching is performed at element level. To verify the efficiency of the proposed contact detection algorithm of BEM, numerical example is presented.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.1E
• /
• pp.20-24
• /
• 2001

We propose the computation reduction method of real root method that is mainly used in the CELP(Code Excited Linear Prediction) vocoder. The real root method is that if polynomial equations have the real roots, we are able to find those and transform them into LSF[1]. However, this method takes much time to compute, because the root searching is processed sequentially in frequency region. But, the important characteristic of LSF is that most of coefficients are occurred in specific frequency region. So, the searching frequency region is ordered by each coefficient's distribution. And coefficients are searched in ordered frequency region. Transformation time can be reduced by this method than the sequential searching method in frequency region. When we compare this proposed method with the conventional real root method, the experimental result is that the searching time was reduced about 46% in average.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.5
• /
• pp.19-28
• /
• 2015

Korea Digital Copyright Exchange of Korea Copyright Commission runs and manages copyrighted works and copyright license agreement, as well as assigns Integrated Copyright Number(ICN) to copyrighted works, also offers copyrighted works searching service. Keyword-based searching method based on ICN metadata provides results depending on the inclusion of metadata keyword. However, keyword-based searching method has limitations that cannot provide exact results that users need. Therefore, the essential method of offering exact result is needed. In this paper, we propose the semantic-based searching method about copyrighted works to increase the accuracy of searching results by extending ICN matadata to ontology, and implement the ontology of copyrighted works by defining relation and semantics about metadata elements. In order to compare semantic-based searching based on the ontology of copyrighted works with keyword-based searching method, the search results of each method according to 5 scenarios are presented and the accuracy of each method is compared.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.119-122
• /
• 2003

This paper presents an efficient huffman decoding method based on the multiple branch technique. In the proposed search method, the internal node which does not contain a leaf node are removed for decrease the searching time and the memory consumption. The proposed search method gives 44％ of improved in searching time and 34％ of decreased in memory requirement compared to the binary search method.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.141-145
• /
• 1995

Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.