• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.295-298
• /
• 2002

This paper presents a fast block-matching algorithm to improve the conventional Three-Step Search (TSS) based method. The proposed Comparison Fast Block Matching Algorithm (CFBMA) begins with DAB for adaptive search range to choose searching method, and searches a part of search window that has high possibility of motion vector like other partial search algorithms. The CFBMA also considers the opposite direction to reduce local minimum, which is ignored in almost conventional based partial search algorithms. CFBMA uses the summation half-stop technique to reduce the computational load. Experimental results show that the proposed algorithm achieves the high computational complexity compression effect and very close or better image quality compared with TSS, SES, NTSS based partial search algorithms.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.245-248
• /
• 2000

This paper proposes a cooperative parallel tabu search which incorporates with the historical information exchange among processors in addition to its own searching of each processor. We investigate the influence of our proposed cooperative parallel tabu search by comparison with a serial tabu search. We also propose two extensions of the cooperative parallel tabu search which are the cooperative construction of tabu memory and the selection of cooperative partner. Through computational experiment, we observe the improvement of solutions by our proposed method.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.433-439
• /
• 2019

Artificial bee colony algorithm is a strong global search algorithm which exhibits excellent exploration ability. The conventional ABC algorithm adopts employed bees, onlooker bees and scouts to cooperate with each other. However, its one dimension and greedy search strategy causes slow convergence speed. To enhance its performance, in this paper, we abandon the greedy selection method and propose an artificial bee colony algorithm with special division and intellective search (ABCIS). For the purpose of higher food source research efficiency, different search strategies are adopted with different employed bees and onlooker bees. Experimental results on a series of benchmarks algorithms demonstrate its effectiveness.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.203-210
• /
• 2023

In this paper, we develope a stock trading system that automatically buy and sell stocks in Kiwoom Securities' HTS system. The system is made by using Kiwoom Open API+ with the Python programming language. A trading strategy is based on an enhanced system query method called a Condition-Search. The Condition-Search script is edited in Kiwoom Hero 4 HTS and the script is stored in the Kiwoom server. The Condition-Search script has the advantage of being easy to change the trading strategy because it can be modified and changed as needed. In the HTS system, up to ten Condition-Search scripts are supported, so it is possible to apply various trading methods. But there are some restrictions on transactions and Condition-Search in Kiwoom Open API+. To avoid one problem that has transaction number and frequency are restricted, a method of adjusting the time interval between transactions is applied and the other problem that do not support a threading technique is solved by an IPC(Inter-Process Communication) with multiple login IDs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5A
• /
• pp.267-275
• /
• 2003

In UMTS terminal modem uses 3 step search procedure for initial cell search, which comprises 1) slot synchronization, 2) code group identification and frame synchronization, and 3) scrambling-code identification. The performance of initial cell search procedure depends on search parameters like observation time and threshold. The purpose of this paper is to get the optimal observation time and threshold of each step for minimum mean acquisition time. In this paper we induce mean detection time of each step and mean acquisition timefrom the model of 3 step search procedure using state diagram. Also we propose initial cell search algorithm which utilize window search method against initial oscillator error, and select an appropriate observation time and threshold of each step by the analysis of simulation and induced result. It is shown that the mean acquisition time in multipath fading channel can be shorter than 500ms by using the determined observation time and threshold of each step.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.875-878
• /
• 2007

Up until now, when a user search product information, the keyword-based search that mainly uses frequency of words or vocabulary information has been utilized in large. In the keyword-based research, the user should have to bear additional burden in order to search the displayed results manually once again because it shows those files that have no connection at all with the inquiries made by the user. To resolve such a problem, ontology has been emerged. In this paper, product search system using ontology was constructed directly and also tested how accurate search it does perform through the searching according to classification. To test this, about 40,000 product data of A discount store, which was operating on/off line discount stores, were constructed as database, and developmental environment for User Interface was tested by having developed the search system using JSP and PowerBuilder 9.0. Results from the test proved that the search method using Domain Ontology for product presented and designed in this paper was superior to the existing keyword-based search method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.37-42
• /
• 2015

Although online search engine service provide a convenient means to search for information on the World Wide Web, it also poses a risk of disclosing privacy. Regardless of such risk, most of users are neither aware of their personal information being exposed on search results nor how to redress the issue by requesting removal of information. According to the 2015 parliamentary inspection of government offices, many government agencies were criticized for mishandling of personal information and its leakage on online search engine such as Google. Considering the fact that the personal information leakage via online search engine has drawn the attention at the government level, the online search engine and privacy issue needs to be rectified. This paper, by examining current online search engines, studies the degree of personal information exposure on online search results and its underlying issues. Lastly, based on research result, the paper provides a sound policy and direction to the removal of exposed personal information with respect to search engine service provider and user respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.598-606
• /
• 2003

In this paper, we analyze the performance of the PCM cell search algorithm proposed for fast cell search of WCDMA systems. In order to improve both performance and complexity of the cell search algorithm standardized for WCDMA systems the PCM scheme uses a group of the polarization codes produced by a Gold code generator. The PCM scheme only uses one synchronization channel since the polarization codes modulated on P-SCH can replace the RS codes of S-SCH. Thus, the PCM reduces the BS's transmission power since only one synchronization channel can be used, and it can also reduce the complexity of receiver as compared with the conventional one. In this paper, by defining a numerical model, we analyze the performance of the PCM cell search algorithm in terms of detection probability and mean acquisition time. Consequently, we could demonstrate that the PCM cell search algorithm is superior to the standard WCDMA cell search algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.71-79
• /
• 2006

Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.397-400
• /
• 2016

In this paper, we propose an efficient algorithm for computing architecture for high-performance Inter Prediction SAD HEVC encoder. HEVC Motion Estimation (ME) of the Inter Prediction is a process for searching for the currently high prediction block PU and the correlation in the interpolated reference picture in order to remove temporal redundancy. ME algorithm uses full search(FS) or fast search algorithm. Full search technique has the guaranteed optimal results but has many disadvantages which include high calculation and operational time due to the motion prediction with respect to all candidate blocks in a given search area. Therefore, this paper proposes a new algorithm which reduces the computational complexity by reusing the SAD operation in full search to reduce the amount of calculation and computational time of the Inter Prediction. The proposed algorithm is applied to an HEVC standard software HM16.12. There was an improved operational time of 61% compared to the traditional full search algorithm, BDBitrate was decreased by 11.81% and BDPSNR increased by about 0.5%.