• Journal of Korean Institute of Industrial Engineers
• /
• v.5 no.1
• /
• pp.45-51
• /
• 1979

This paper presents a heuristic solution procedure for the quadratic assignment problem, ranking procedure, which can handle the case where not all of the facilities have the same size of area. The ranking procedure is found more efficient than two other existing heuristic procedures from results of computational experience. Based on the out-patients flow pattern and the procedure developed, an improved layout of the three existing general hospitals is developed with the objective of minimizing the total distance travelled by patients in the central and the out-patient clinic.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.575-578
• /
• 2003

본 논문은 제한된 영역 안의 다수 물고기를 추적하는 방법을 제안한다. 고정된 카메라로 물고기가 있는 수조의 영상을 얻은 다음 실시간으로 얻는 매경영상을 통해 물고기의 이미지만을 얻는다. 이렇게 얻어진 이미지를 ART2 알고리즘을 통해 clustering을 하고 각각의 물고기라 추정되는 cluster와 이전까지 측정되어진 물고기 좌표와의 거리 계산을 통해 각각의 물고기의 개체 인식을 하게 된다. 본 논문에서는 기존의 물고기 이미지를 얻는 방법을 개선하여 다 개체 추적을 위한 깨끗한 개체 이미지를 얻는 방법과, 각 cluster들과 이진 물고기 위치와의 거리계산을 통한 개체 인식 방법에 대해 초점을 맞추었다.

• Proceedings of the KIEE Conference
• /
• 2000.07e
• /
• pp.95-98
• /
• 2000

This paper presents a technique for contingency ranking using line capacity calculation method and outage distribution factors (LODF) which are established by generation shift distribution factors from DC load flow solutions. By using the LODF, the line flow can be calculated a ccording to the modification of base load flow if the contingency occur. To obtain contingency ranking, maximum power tansferred to the load is obtained when load impedance $Z_r$ equal to line impedance $Z_s$. The proposed algorithm has been validated in tests on a 6-bus test system.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.9-16
• /
• 2016

In this paper, we present a performance evaluation agent based on fuzzy cluster analysis and validity measures. The proposed agent is consists of three modules, fuzzy cluster analyzer, performance evaluation measures, and feature ranking algorithm for feature selection step in CAD system. Feature selection is an important step commonly used to create more accurate system to help human experts. Through this agent, we get the feature ranking on the dataset of mass and calcification lesions extracted from the public real world mammogram database DDSM. Also we design a CAD system incorporating the agent and apply five different feature combinations to the system. Experimental results proposed approach has higher classification accuracy and shows the feasibility as a diagnosis supporting tool.

• Journal of KIISE
• /
• v.44 no.2
• /
• pp.179-185
• /
• 2017

Document summarization aims to generate a summary that is consistent and contains the highly related sentences in a document. In this study, we implemented for document summarization that extracts highly related sentences from a whole document by considering both similarities and entailment relations between sentences. Accordingly, we proposed a new algorithm, TextRank-NLI, which combines a Recurrent Neural Network based Natural Language Inference model and a Graph-based ranking algorithm used in single document extraction-based summarization task. In order to evaluate the performance of the new algorithm, we conducted experiments using the same datasets as used in TextRank algorithm. The results indicated that TextRank-NLI showed 2.3% improvement in performance, as compared to TextRank.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.9 no.1
• /
• pp.122-130
• /
• 2001

In order to improve the efficiency of the design process and the quality of the resulting design, this study proposes a design method for determining design variables of an automotive wheel-bearing unit of double-row angular-contact ball bearing type by using a genetic algorithm. The desired performance of the wheel-bearing unit is to maximize system life while satisfying geometrical and operational constraints without enlarging mounting spae. The use of gradient-based optimization methods for the design of the unit is restricted because this design problem is characterized by the presence of discrete design variables such as the number of balls and standard ball diameter. Therefore, the design problem of rolling element bearings is a constrained discrete optimization problem. A genetic algorithm using real coding and dynamic mutation rate is used to efficiently find the optimum discrete design values. To effectively deal with the design constraints, a ranking method is suggested for constructing a fitness function in the genetic algorithm. A computer program is developed and applied to the design of a real wheel-bearing unit model to evaluate the proposed design method. Optimum design results demonstrate the effectiveness of the design method suggested in this study by showing that the system life of an optimally designed wheel-bearing unit is enhanced in comparison with that of the current design without any constraint violations.

• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.23-31
• /
• 2003

Link-based search engines generate the rank using linked information of related web-documents . HITS(Hypertext Internet Topic Search), representative ranking evaluation algorithm using a special feature of web-documents based on such link, evaluates the importance degree of related pages from linked information and presents by ranking information. Problem of such HITS algorithm only is considered the link frequency within documents and depends on the set of web documents as input value. In this paper, we design the search agent based on better HITS algorithm according to advanced suitability between query and search-result in the set of given documents from link-based web search engine. It then complements locality of advanced search performance and result.

• Journal of Korean Institute of Industrial Engineers
• /
• v.9 no.2
• /
• pp.3-8
• /
• 1983

The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.3
• /
• pp.268-274
• /
• 2005

Since introduction of the PageRank technique, it is known that it ranks web pages effectively In spite of its usefulness, we found a computational drawback, which we call norm-leak, that PageRank values become smaller than they should be in some cases. We present an improved PageRank algorithm that computes the PageRank values of the web pages correctly as well as its efficient implementation. Experimental results, in which over 67 million real web pages are used, are also presented.

• Journal of the Korea Safety Management & Science
• /
• v.5 no.1
• /
• pp.69-82
• /
• 2003

The sequence which minimizes overall utility work in car assembly lines reduces the cycle time, the number of utility workers, and the risk of conveyor stopping. This study suggests mathematical formulation of the sequencing problem to minimize overall utility work, and present a genetic algorithm which can provide a near optimal solution in real time. To apply a genetic algorithm to the sequencing problem in car assembly lines, the representation, selection methods, and genetic parameters are studied. Experiments are carried out to compare selection methods such as roullette wheel selection, tournament selection and ranking selection. Experimental results show that ranking selection method outperforms the others in solution quality, whereas tournament selection provides the best performance in computation time.