• Proceedings of the Korean Society for Quality Management Conference
• /
• 2009.10a
• /
• pp.131-135
• /
• 2009

This paper considers the sequencing of products in car assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time 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. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality and computation time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

• International Journal of Human Ecology
• /
• v.4 no.2
• /
• pp.39-53
• /
• 2003

This study was designed to provide a better understanding of Korean female Internet users' intention to search for information regarding apparel goods and to shop for these goods. Shopping orientation, familiarity, and prior purchase experience were seen as influencing the intention to use the Internet for information search. An important aspect in the search habits that a consumer adopts in gathering information for their buying decisions was Internet shopping attitude. The objective was to predict apparel shopping in terms of prior Internet shopping experience, familiarity, intention to search information via the Internet, and shopping orientation. Internet shopping attitude, familiarity, prior purchase experience, and intention to use to search information were significant in predicting Internet apparel shopping. The most important determinants which influenced Internet shopping were attitude toward Internet shopping and intention to search. In considering the results of the present study, one should recognize the inherent limitations associated with generalizing these findings beyond the sample and the consumer products examined which in this study were apparel goods. Also this study focused on female computer users only. Therefore, future research should utilize more broadly based samples and refine the instrument to distinguish among different apparel products. This study does provide some information that should be helpful to retailers targeting the women's online apparel market.

• Journal of Korean Library and Information Science Society
• /
• v.42 no.4
• /
• pp.263-280
• /
• 2011

This study aims to investigate current status of mobile search services of Korean search portals, and analyze mobile unified search contents of Naver and Google Korea. In particular, this study analyzed characteristics of mobile unified search such as number of retrieved documents, collection distribution, and yearly distribution. Also, documents were evaluated in terms of relevance, credibility, and currency. This study compared quality of Naver's unified Web best and unified Web, and Google's best Web documents and Web documents. The correlation between document's ranking and document's relevance was analyzed. The results of this study can be implemented to the portal's effective development of mobile search service.

• Journal of Korea Multimedia Society
• /
• v.5 no.6
• /
• pp.745-752
• /
• 2002

A* algorithm is widely used in optimal car route search which is a kind of informed search, since the locations of starting and ending points are known a priori. Unidirectional A* algorithm requires considerable search time but guarantees a optimal path, bidirectional A* algorithm does not guarantee a optimal path and takes even longer search time than unidirectional search to guarantee a optimal path. In this paper, a new bidirectional A* algorithm which requites less search time and guarantees a optimal path is proposed. To evaluate the efficiency of the proposed algorithm, several experiments are conducted in real road map and the results show that the algorithm is very effective in terms of finding a optimal path and search time.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.103-106
• /
• 2007

The importance of intellectual property right becomes larger and the number of the person who uses a patent search is increasing. When considering the search pattern of the general user who uses only one or two search terms, it is not easy task to find desirable search result in the massive patent documents. So we present patent search system based on IPC Clustering which helps users confine the search result by using international patent classification (IPC) which provided from all patent documents. By using this system, the general users can find patent search result more effectively.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.362-368
• /
• 2005

This paper is related to the fast block matching algorithm, especially a method for expanding the search pattern using the second local matching point in the adaptive hexagonal search. To reduce the local minima problem in fast motion estimation, the proposed method expands the search pattern by adding new searching points selected by using the second local matching point to conventional search pattern formed by the first local matching point in the adaptive hexagonal search. According to estimating the motion vector by applying block matching algorithm based on hexagonal search to the expanded search pattern, the proposed method can effectively carry out fast motion estimation to improve the performance in terms of compensated image quality.

• The Journal of the Korea Contents Association
• /
• v.8 no.11
• /
• pp.41-48
• /
• 2008

This study focuses on the modeling file search engine and suggesting modified file search schema based on weight value using file contents in order to improve the performance in terms of search accuracy and matching time. Most of the file search engines have used string matching algorithms like KMP(Knuth.Morris.Pratt), which may limit portability and fast searching time. However, this kind of algorithms don't find exactly the files what you want. Hence, the file search engine based on weight value using file contents is proposed here in order to optimize the performance for mobile environments. The Comparison with previous research shows that the proposed schema provides better.

• Journal of Digital Contents Society
• /
• v.11 no.1
• /
• pp.105-115
• /
• 2010

Search engines provide web documents that are related to user's query. However, using only the query terms that user provided, it is hard for search engines to know user's exact intention and provide the very matching web documents. To remedy this problem, search systems are needed to exploit personalized search technologies. In this paper, we propose not only a novel personalized query recommendation scheme based on folksonomy but also a new personalized search service architecture which reduces the risk of privacy violation while enabling search service providers to provide other various personalized services such as personalized advertisement.

• Journal of KIISE:Software and Applications
• /
• v.37 no.10
• /
• pp.745-750
• /
• 2010

To effectively retrieve mathematical documents including various equations, mathaware search engines are needed. In this paper, we propose a equation retrieval system which helps users effectively search structurally similar equations. The proposed system disassembles MathML equations into three types of heterogeneous indexing terms; operators, variables, and partial structures of equations. Then, it independently indexes the disassembled terms. When a user inputs a MathML equation, the proposed system searches and ranks equations using weighted sums of three language models for the heterogeneous indexing terms. In the experiments with 244,744 MathML equations, three proposed system showed reliable performances (a P@1 of 53% in the closed test and a P@1 of 63% in the open test).

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.8
• /
• pp.281-286
• /
• 2018

With recent increase in complexity and variety of information and massively available information, interest in and necessity of ontology has been on the rise as a method of extracting a meaningful search result from massive data. Although there have been proposed many methods of extracting the ontology from a given text of a natural language, the extraction based on most of the current methods is not consistent with the structure of the ontology. In this paper, we propose a method of automatically creating ontology by distinguishing a term needed for establishing the ontology from a text given in a specific domain and extracting various relationships between the terms based on the pattern-based method. To extract the relationship between the terms, there is proposed a method of reducing the size of a searching space by taking a matching set of patterns into account and connecting a join-set concept and a pattern array. The result is that this method reduces the size of the search space by 50-95% without removing any useful patterns from the search space.