• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.269-272
• /
• 2010

In this paper, we propose the computation reduction methods of delta pitch search that is used in G.723.1 vocoder. In order to decrease the computational amount in delta pitch search the characteristic of proposed algorithms is as the following. First, scheme to reduce the computation amount in delta pitch search uses NAMDF. Developed the second scheme is the skipping technique of lags in pitch searching by using the threshold value. By doing so, we can reduce the computational amount of pitch searching more than 64% with negligible quality degradation.

• Proceedings of the Safety Management and Science Conference
• /
• 2008.11a
• /
• pp.35-39
• /
• 2008

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.5
• /
• pp.77-86
• /
• 1995

In this paper in order to reduce the encoding complexity required in the full search vector quantization(VQ), a new classified vector quantization(CVQ) technique is described employing the minimum-distance classifier. The determination of the optimal subcodebook sizes for each class is an important task in CVQ designs and is not an easy work. Therefore letting the subcodebook sizes be equal. A CVQ technique. Which satisties the optimal CVQ condition approximately, is proposed. The proposed CVQ is a kind of the partial search VQ because it requires a search process within each subcodebook only, and the minimum encoding complexity since the subcodebook sizes are the same in each class. But simulation results reveal while the encoding complexity is only O(N$^{1/2}$) comparing with O(N) of the full-search VQ. A simple systolic array, which has the through-put of k, is also proposed for the implementation of the VQ. Since the operation of the classifier is identical with that of the VQ, the proposed array is applied to both the classifier and the VQ in the proposed CVQ, which shows the usefulness of the proposed CVQ.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1367-1376
• /
• 1998

In this paper we propose an real time marker detection algorithm for motion analysis both in 2 dimensions and 3 dimensions with CCD camera and rfame grabber only which has no image processor. The main algorithm consists of the following 3 algorithms; 1) the tracing algorithm that makes it possible to predict the expected marker location by narrowing the searching boundary, 2) the searching algorithm that detects the marker in the expected boundary using Ad-hoc previous screen search technique, tornado search method rotate diagonal search method search technique, 3) the algorithm that finds the central point of the detected marker. We try to narrow the searching boundary for real time processing. Also, it is able to find the central point of the detected marker much faster than typical contour tracing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.9
• /
• pp.4624-4640
• /
• 2017

This paper mainly presents a secure and efficient e-Medical Record System via searchable encryption scheme from asymmetric pairings, which could provide privacy data search and encrypt function for patients and doctors in public platform. The core technique of this system is an extension public key encryption system with keyword search, which the server could test whether or not the files stored in platform contain the keyword without leaking the information about the encrypted file. Compared with former e-medical record systems, the system proposed here has several superior features: (1)Users could search the data stored in cloud server contains some keywords without leaking anything about the origin data. (2) We apply asymmetric pairings to achieve shorter key size scheme in the standard model, and adopt the dual system encryption technique to reduce the scheme's secure problem to the hard Symmetric External Diffie-Hellman assumption, which could against the variety of attacks in the future complex network environment. (3) In the last of paper, we analyze the scheme's efficiency and point out that our scheme is more efficient and secure than some other classical searchable encryption models.

• Journal of Ocean Engineering and Technology
• /
• v.37 no.4
• /
• pp.145-157
• /
• 2023

Due to a recent increase in maritime activities in South Korea, the frequency of maritime distress is escalating and poses a significant threat to lives and property. The aim of this study was to validate a drift trajectory prediction technique to help mitigate the damages caused by maritime distress incidents. In this study, OpenDrift was verified using satellite drifter data from the Korea Hydrographic and Oceanographic Agency. OpenDrift is a Monte-Carlo-based Lagrangian trajectory modeling framework that allows for considering leeway, an important factor in predicting the movement of floating marine objects. The simulation results showed no significant differences in the performance of drift trajectory prediction when considering leeway using four evaluation methods (normalized cumulative Lagrangian separation, root mean squared error, mean absolute error, and Euclidean distance). However, leeway improved the performance in an analysis of location prediction conformance for maritime search and rescue operations. Therefore, the findings of this study suggest that it is important to consider leeway in drift trajectory prediction for effective maritime search and rescue operations. The results could help with future research on drift trajectory prediction of various floating objects, including marine debris, satellite drifters, and sea ice.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.75-82
• /
• 2010

The paper proposed CBIRS/EFI with contents based search technique using edge feature information of the object from image information of the object which is uncertain. In order to search specially efficiently case of partial image information of the object, we used the search technique which extracts outline information and color information in feature information of object. In order to experiment this, we extracted side edge feature information of the vehicle for feature information of the object after capture the car image of the underground garage. This is the system which applies a contents base search by the result which analyzes the image which extracts a feature, an original image to search and a last similar measurement result. This system compared in FE-CBIRS systems which are an existing feature extraction contents base image retrieval system and the function which improves the accuracy and an effectiveness of search rate was complemented. The performance appraisal of CBIRS/EFI systems applied edge extraction feature information and color information of the cars. And we compared a color feature search time, a shape characteristic search time and a search rate from the process which searches area feature information. We extracted the case 91.84% of car edge feature extraction rate. And a average search time of CBIRS/EFI is showing a difference of average 0.4-0.9 seconds than FE-CBIRS from vehicle. color search time, shape characteristic search time and similar search time. So, it was proven with the fact that is excellent.

• Journal of Digital Contents Society
• /
• v.14 no.4
• /
• pp.463-469
• /
• 2013

The set-based POI search algorithm showed better performance than the existing hard matching search when inaccurate queries are entered. In the set-based POI search algorithm, however, there is a problem that can't classify duplicate characters within a record. This is due to it's 'set-based' search property. To solve this problem, we improve the existing set-based POI search algorithm. In this paper, we propose and implement an improved set-based POI search algorithm that is able to deal duplicate characters properly. From the experimental results, we can find that our technique for duplicate characters improves the performance of the existing set based POI search algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.8-15
• /
• 2003

Recently various of information suppliers provide information via WWW so the necessary of search engine grows larger. However the efficiency of most search engines is low comparatively because of using simple pattern match technique between user's query and web document. A specialized search engine returns the specialized information depend on each user's search goal. It is trend to develop specialized search engines in many countries. However, most such engines don't satisfy the user's needs. This paper proposes the specialized search engine for ocean information that uses user's query related with ocean and the association rules in web data mining can prove relation between web documents. So this search engine improved the recall of data and the precision in existent search method.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1999.08a
• /
• pp.98-106
• /
• 1999

In this study cold rolling process for the irregular cross-sectional shape has been investigated. The product analyzed in present study is the steel cutter, which is frequently used to cut the desired shape on leather. Because steel cutter always has a irregular cross-section, after rolling process the workpiece is severely bended to every direction. The bending of the workpiece affects the processed performed after rolling such as heat treatment and grinding, then that of the workpiece becomes more severe. In this study, therefore, to prevent the bending of the workpiece to the left and right sides. rigid-plastic finite element method has been utilized and in order to find optimal roll geometry rapidly, one dimensional equal interval search technique has been also introduced. By using both rigid plastic finite element method and optimum technique, cold rolling process for the irregular cross-sectional shape has been successfully investigated.