• Steel and Composite Structures
• /
• v.7 no.3
• /
• pp.201-217
• /
• 2007

Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.2
• /
• pp.119-128
• /
• 2013

Most internet users utilize internet portal search engines, such as Naver, Daum and Google nowadays. But since the results of internet portal search engines are based on universal criteria (e.g. search frequency by region or country), they do not consider personal interests. Namely, current search engines do not provide exact search results for homonym or polysemy because they try to serve universal users. In order to solve this problem, this research determines keyword importance and weight value for each individual search characteristics by collecting and analyzing customized keyword at external database. The customized keyword weight values are integrated with search engine results (e.g. PageRank), and the search ranks are rearranged. Using 50 web pages of Goolge search results for experiment and 6 web pages for customized keyword collection, the new customized search results are proved to be 90% match. Our personalization approach is not the way that users enter preference directly, but the way that system automatically collects and analyzes personal information and then reflects them for customized search results.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2018.05a
• /
• pp.185-186
• /
• 2018

The slabfrom, which is commonly used in construction sites, has drawbacks in that the workability of the workers is reduced due to their heavy weight. This study investigates the possibility of design optimization of euro form between structural stability and weight using harmonic search algorithm. The harmonic search algorithm is a metaheuristic optimization technique that obtains multiple optimal solution candidates through iterative. As a result of multiple attempts of optimization through the algorithm, it was possible to design the formwork which is structurally stable and light in weight than the existing formwork.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.146-149
• /
• 2000

In this paper, Computer Colour Matching and Kitchen System (CCMKS) is developed on the basis of delphi package and one-chip processor with fuzzy-PID control. CCMKS will be widely used in the colour dyeing industry as an integrated colour matching and dispensing system which have more advantages than the conventional matching or dispensing system, when controlling the real dyeing processes. Delphi is utilized in making database and search/matching routes. The developed matching function reduces the search and matching time to about one third. One-chip processor is designed and manufactured for the distributed control of three-phase induction motors. Fuzzy-PID control is applied to the speed control of three-phase induction motors for a very precise weight of colour at CCMKS. The developed kitchen function decreases the dispensing time to about one twentieth. The experimental results show CCMKS has more excellent search time, more precise weight and much high fidelity than conventional colour matching or dispensing system, in the performance.

• Steel and Composite Structures
• /
• v.9 no.6
• /
• pp.535-555
• /
• 2009

The harmony search method based optimum design algorithm is presented for geometrically non-linear semi-rigid steel frames. Harmony search method is recently developed metaheuristic algorithm which simulates the process of producing a musical performance. The optimum design algorithm aims at obtaining minimum weight steel frames by selecting from standard set of steel sections such as European wide flange beams (HE sections). Strength constraints of Turkish Building Code for Steel Structures (TS648) specification and displacement constraints were used in the optimum design formulation. The optimum design algorithm takes into account both the geometric non-linearity of the frame members and the semi-rigid behaviour of the beam-to-column connections. The Frye-Morris polynomial model is used to calculate the moment-rotation relation of beam-to-column connections. The robustness of harmony search algorithm, in comparison with genetic algorithms, is verified with two benchmark examples. The comparisons revealed that the harmony search algorithm yielded not only minimum weight steel frames but also required less computational effort for the presented examples.

• Journal of KIISE:Software and Applications
• /
• v.37 no.8
• /
• pp.620-628
• /
• 2010

With the use of the Internet pervasive in everyday life, people are now able to retrieve a lot of information through the web. However, exponential growth in the quantity of information on the web has brought limits to online search engines in their search performance by showing piles and piles of unwanted information. With so much unwanted information, web users nowadays need more time and efforts than in the past to search for needed information. This paper suggests a method of using query expansion in order to quickly bring wanted information to web users. Popularity based Term Weight Mensuration better performance than the TF-IDF and Simple Popularity Term Weight Mensuration to experiments without changes of search subject. When a subject changed during search, Popularity based Term Weight Mensuration's performance change is smaller than others.

• 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 the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.5
• /
• pp.293-302
• /
• 2019

In mountain accident events, it is important for the search team commander to determine the search area in order to secure the Golden Time. Within this period, assistance and treatment to the concerned individual will most likely prevent further injuries and harm. This paper proposes a method to determine the search priority area based on missing persons behavior and missing persons incidents statistics. GIS (Geographic Information System) and MCDM (Multi Criteria Decision Making) are integrated by applying WLC (Weighted Linear Combination) techniques. Missing persons were classified into five types, and their behavioral characteristics were analyzed to extract seven geographic analysis factors. Next, index values were set up for each missing person and element according to the behavioral characteristics, and the raster data generated by multiplying the weight of each element are superimposed to define models to select search priority areas, where each weight is calculated from the AHP (Analytical Hierarchy Process) through a pairwise comparison method obtained from search operation experts. Finally, the model generated in this study was applied to a missing person case through a virtual missing scenario, the priority area was selected, and the behavioral characteristics and topographical characteristics of the missing persons were compared with the selected area. The resulting analysis results were verified by mountain rescue experts as 'appropriate' in terms of the behavior analysis, analysis factor extraction, experimental process, and results for the missing persons.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.486-489
• /
• 2002

This paper proposes a tabu search (TS) algorithm to optimal weight selection in design of robust H$_{\infty}$ power system stabilize. (PSS), In H$_{\infty}$ control design, the weight selection and the representation of system uncertainties are the major difficulties. To cope with these problems, TS is employed to automatically search for the optimal weights. On the other hand, the normalized coprime factorization (NCF) is used. The H$_{\infty}$ controller can be directly developed without ${\gamma}$-iteration. Also, the pole-zero cancellation phenomena are prevented. The performance and robustness of the proposed PSS under different loading conditions are investigated in comparison with a robust tuned PSS by examining the case of a single machine infinite bus (SMIB) system. The simulation results illustrate the effectiveness and robustness of the proposed PSS.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.591-601
• /
• 2012

Unstructured peer-to-peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social-like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social-like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.