• Journal of Internet Computing and Services
• /
• v.18 no.4
• /
• pp.109-119
• /
• 2017

This paper is to analyse empirically using the data collected from Korea portal Naver's ad management system and show online ad platform may not be two-sided market. It is aim of this study to propose the appropriate approach to define the market, based on the empirical result. Here are two research questions to be reviewed. First, is there any consistency between business model of search advertising and definition of two-sided market which Rochet-Tirole proposed in 2006? Second, do indirect network externalities exist significantly in search advertising market? if so, this study is going to estimate the level of it through empirical measurement. Based on Luchetta's paper which suggested that google may be one-sided market, it performed the correlation & regression analysis to prove his suggestion. The result is that online search advertising costs increased by more than 50 won when advertisers increased by one unit. However, there was no significant correlation and regression between the search frequency and online search advertising cost. It means that there is little possibility to identify two-sidedness in online search advertising service(market) because of no(or little) indirect network externalities which are a necessary condition for two-sided market. This result has three implications, such as the availability to adapt traditional market definition tools to online search advertising market, the possibility enhancement to find the fundamental competition elements in defined market and promotion of the powers of persuasion in competitive market reality. It is significant that the gap between legal scholars including regulatory practitioners and economists can be overcome to some extent. who have shown the different perspective on the two-sided market.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.4
• /
• pp.571-582
• /
• 2008

This paper analyzes global convergence of the univariate dynamic encoding algorithm for searches (uDEAS) and provides an application result to function optimization. uDEAS is a more advanced optimization method than its predecessor in terms of the number of neighborhood points. This improvement should be validated through mathematical analysis for further research and application. Since uDEAS can be categorized into the generating set search method also established recently, the global convergence property of uDEAS is proved in the context of the direct search method. To show the strong performance of uDEAS, the global minima of four 30 dimensional benchmark functions are attempted to be located by uDEAS and the other direct search methods. The proof of global convergence and the successful optimization result guarantee that uDEAS is a reliable and effective global optimization method.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.10 no.1
• /
• pp.45-51
• /
• 2005

This paper presents a comparison of rotor position estimation of a switched reluctance motor(SRM) with built-in search coils by three methods. The search coil EMFs are not generated in the SRM with built-in search coils at standstill. So an initial rotor position estimation method is needed. In this paper squared euclidean distance, fuzzy logic and neural network methods we proposed for the estimation of initial rotor position. The simulated results of the three methods are compared. The simulated result of the squared euclidean distance method, which has the best performance, is supported by the experimental result.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.357-371
• /
• 2005

In this Paper, we propose a new motion search algorithm called CDTS (Cross-Diamond-Triangle Search algorithm) that uses optimal search pattern according to the position of a search area to improve the performance of CDS(Cross-Diamond Search algorithm) as well as CDHSs(Cross-Diamond-Hexagonal Searches algorithms). We analyze motion distributions in various test video sequences to apply optimal search pattern according to a position of search area. Based on the result of this analysis, we propose a new triangle-shaped search pattern whose structure is asymmetric while previous search patterns are generally symmetric in conventional algorithms. In CDTS, we apply cross- and diamond-shaped search patterns to central search areas, and triangle- and diamond-shaped patterns to the other areas. Applying CDTS to test video sequences, the proposed scheme can reduce search points more than CDS and CDHSs by 16.22$\%$ and 3.09$\%$, respectively, without any visual quality degradation.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.43-46
• /
• 2000

In this paper, we propose a fast adaptive diamond search algorithm(FADS) for block matching motion estimation. Fast motion estimation algorithms reduce the computational complexity by using the UESA (Unimodal Error Search Assumption) that the matching error monotonically increases as the search moves away from the global minimum error. Recently many fast BMAs(Block Matching Algorithms) make use of the fact that the global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the adjacent blocks. We change the origin of search window according to the spatially adjacent motion vectors and their MAE(Mean Absolute Error). The computer simulation shows that the proposed algorithm has almost the same computational complexity with UCBDS(Unrestricted Center-Biased Diamond Search)〔1〕, but enhance PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS(Full Search), even for the large motion case, with half the computational load.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

• Journal of Information Technology Applications and Management
• /
• v.16 no.1
• /
• pp.21-36
• /
• 2009

As the World Wide Web (WWW) has become a major channel for information delivery, the data accumulated in the Internet increases at an incredible speed, and it derives the advances of information search technologies. It is the search engine that solves the problem of information overloading and helps people to identify relevant information. However, as search engines become a powerful tool for finding information, the opportunities of plagiarizing have increased significantly in e-Learning. In this paper, we developed an online plagiarism detection system for detecting plagiarized documents that incorporates the functions of search engines and acts in exactly the same way of plagiarizing. The plagiarism detection system uses morpheme analysis to improve the performance and sentence-based comparison to investigate document comes from multiple sources. As a result of applying this system in e-Learning, the performance of plagiarism detection was improved.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.496-503
• /
• 2010

Speech recognition system is developed of standalone, In case of a mobile terminal using that low recognition rate represent because of limitation of memory size and audio compression. This study suggest vocabulary recognition highest performance improvement system for separate acoustic search and lexical search. Acoustic search is carry out in mobile terminal, lexical search is carry out in server processing system. feature vector of speech signal extract using GMM a phoneme execution, recognition a phoneme list transmission server using Lexical Tree Search algorithm lexical search recognition execution. System performance as a result of represent vocabulary dependence recognition rate of 98.01%, vocabulary independence recognition rate of 97.71%, represent recognition speed of 1.58 second.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.20-29
• /
• 2003

According as quantity of information is augmented rapidly in World Wide Web, users are investing more times finding correct information to on. Search function that a search agent is personalized according to user's preference degree or search objective to solve these problem should be offered. Therefore, a search agent accumulates experienced knowledge connected with user's past search in this research. When new query was given, search agent offered learning function of intelligence that decides category group through estimation method of similarity using this knowledge. So this paper showed that case based search can bring superior result in the correctness rate than other search method.

• Journal of the Korean Society for information Management
• /
• v.29 no.4
• /
• pp.101-121
• /
• 2012

Since IR systems which adopt only Boolean IR model can not provide ranked search result, users have to conduct time-consuming checking process for huge result sets one by one. This study proposes a method to provide search results ranked by using coupling information between tags instead of index weight information in Boolean IR model. Because document queries are used instead of general user queries in the proposed method, key tags used as queries in a relevant document are extracted. A variety of groups of Boolean queries based on tag couplings are created in the process of extracting queries. Ranked search result can be extracted through the process of matching conducted with differential information among the query groups and tag significance information. To prove the usability of the proposed method, the experiment was conducted to find research trend analysis information on selected research information. Aslo, the service based on the proposed methods was provided to get user feedback for a year. The result showed high user satisfaction.