• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.33 no.12
• /
• pp.53-62
• /
• 2017

Many gradient-based mathematical methods have been developed and are in use for structural size optimization problems, in which the cross-sectional areas or sizing variables are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. The main objective of this paper is to propose an efficient optimization method for structures with discrete-sized variables based on the harmony search (HS) meta-heuristic algorithm that is derived using penalty function. The recently developed HS algorithm was conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. In this paper, a discrete search strategy using the HS algorithm with a static penalty function is presented in detail and its applicability using several standard truss examples is discussed. The numerical results reveal that the HS algorithm with the static penalty function proposed in this study is a powerful search and design optimization technique for structures with discrete-sized members.

• The Journal of Information Systems
• /
• v.25 no.1
• /
• pp.159-182
• /
• 2016

Purpose This paper aims to develop a novel tabu search algorithm for solving the sequencing problems with precedence constraints. Due to constraints, the traditional meta heuristic methods can generate infeasible solutions during search procedure, which must be carefully dealt with. On the contrary, the candidate order based tabu search (COTS) is based on a novel neighborhood structure that guarantees the feasibility of solutions, and can dealt with a wide range of sequencing problems in flexible manner. Design/methodology/approach Candidate order scheme is a strategy for constructing a feasible sequence by iteratively appending an item at a time, and it has been successfully applied to genetic algorithm. The primary benefit of the candidate order scheme is that it can effectively deal with the additional constraints of sequencing problems and always generates the feasible solutions. In this paper, the candidate order scheme is used to design the neighborhood structure, tabu list and diversification operation of tabu search. Findings The COTS has been applied to the single machine job sequencing problems, and we can see that COTS can find the good solutions whether additional constraints exist or not. Especially, the experiment results reveal that the COTS is a promising approach for solving the sequencing problems with precedence constraints. In addition, the operations of COTS are intuitive and easy to understand, and it is expected that this paper will provide useful insights into the sequencing problems to the practitioners.

• The Journal of Society for e-Business Studies
• /
• v.4 no.3
• /
• pp.179-196
• /
• 1999

A cyber shopping mall is a place where consumers acquire the product information and make purchase decision in the cyber space. Even though there are many advantages over traditional malls, there are still several limitations to do shopping in an existing cyber mall. One of them is the absence of efficient search tool to handle various products specifications. Existing search systems usually support the "keyword search only" with limited product information. Consumers spend lots of their time and efforts in searching products and comparing them. Recently, some web sites provide the shopping mall comparison service that supports the additional search conditions such as price and maker. These services improve the situation but it is not still acceptable. In this paper, we propose an intelligent product search system based on a mediator which supports various conditional search for each product. Our system provides consumers with search results that satisfy purchase specifications. Our system is implemented in Visual basic and pert and experimental results show satisfactory performance.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.1075-1082
• /
• 2003

In this paper, we propose an Efficient Center-Biased Hybrid Seearch (ECBHS) for motion estimation based on Center-Biased Hybrid Search(CBHS). This proposed algorithm employ hybrid of a compact plus shaped search, X shaped search, and diamond search to reduce the search point for motion vectors which distributed within 3pels radius of center of search window. ECBHS reduces the computations for motion estimation of CBHS with similar accuracy The efficiency of the proposed algorithm was verified by experimental results.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2002.05a
• /
• pp.225-231
• /
• 2002

A specialized web search engine is an internet tool for detecting information in finite cyber world. It helps to retrieve necessary information in internet sites quickly In this paper, we design and implement a prototype search engine using method of mining for the association rule discovery. It consists of a search engine part and a search robot part. The search engine uses keyword method and is considered as various user oriented interface. The search robot fetches information related to ship parts n world wide web. The experiments show that our search engine(AISE) is superior to other search engines in collecting necessary informations.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2008

In the Web 2.0, besides more gaining information on the web, the number of web sites that take advantage of RSS increases explosively. Commonly each users search RSS channels through the web search engine before registering RSS channel's url to the RSS reader. Users judge whether the site is RSS channel or not and register an RSS channel's url through theirs interests. Because accomplished by users themselves, those processes conflict to user's convenience and quick consumption of information. Techniques of current search engines can't provide users with reliable RSS feed information as search results. In this paper, we analysis appropriateness of current search engines' techniques that offer users RSS feed search service and discuss their limitations. Also, we make up RSS feed database through classification of RSS tag being possible to search RSS feed information effectively and apply update rate of each RSS channel's feed to ranking algorithm providing more reliable search results.

• Journal of the Korean Institute of Oriental Medical Informatics
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2009

In these days everyone search the information easily with the Internet as the rapid distribution and active usage of the Internet. The search engines were developed specially to accuracy of information retrieval. User search the information more quickly and variously with them. The search portal system will be embossed with representation and basic services. The Internet user needs the result of text, image and video, knowledge search. The keyword based search is used generally for getting result of the information retrieval and another method is category based search. This paper investigates the classification of knowledge search structure for oriental medicine in market leader of search portal system by ranking web site. As a result, each classification system is unified and there is a possibility of getting up a many confusion to the user who approaches with classification systematic search method. This treatise proposed the improved oriental medicine classification system of internet information retrieval in knowledge search area. if the service provider amends about the classification system, there will be able to guarantee the compatibility of data. Also the proper access path of the knowledge which seeks is secured to user.

• Journal of Engineering Education Research
• /
• v.19 no.4
• /
• pp.47-59
• /
• 2016

This paper explores antecedents of entrepreneurial and job search intentions based on the theory of planned behavior. Additionally, it examines the impact of entrepreneurship and job search education on these antecedents of entrepreneurial and job search intentions. The research model has been validated by analyzing 1,432 responses from undergraduate students in South Korea. The results of analysis provide several findings: First, entrepreneurship attitude, entrepreneurship subjective norm, and entrepreneurship self efficacy showed significant positive effects on entrepreneurial intention, but their effects on job search intention were insignificant. Second, while job search attitude showed significant positive effects on both intentions, job search subjective norm showed a significant effect only on job search intention, and job search self efficacy showed a significant effect only on entrepreneurial intention. Third, entrepreneurship education increased all the antecedents of entrepreneurial intention, and reduced job search attitude. These results imply that entrepreneurship and job search education should be managed comprehensively, considering their cross-effects on the antecedents of entrepreneurial and job search intentions.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.261-264
• /
• 2001

This paper relates to a node structure of a multiway search tree and a search method using the node structure and, more particularly, to a search method for accelerating its search speed by reducing the depth of each small tree in a multi-way search tree. The proposed idea can increase the number of keys capable of being recorded on a cache line by using one pointer at a node of the multi-way search tree so that the number of branches in a network address search is also increased and thus the tree depth is reduced. As a result, this idea can accelerate the search speed and the speed of the forwarding engine and accomplish a further speed-up by decreasing required memories and thus increasing a memory rate.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.266-272
• /
• 2002

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. And a manifest contents of query for special expert field so much worse 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. For example, in America, there are a site that searches only the recently updated headline news and the federal law and the government and and so on. 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 search engine uses the association rules in web data mining. So specialized search engine for ocean provides more information related to ocean because of raising recall about user's query