http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
웹 이용자의 접속 정보 분석을 통한 웹 활용 그래프의 구성 및 분석
김후곤,김재교,Kim, Hu-Gon,Kim, Jae-Gyo 한국경영과학회 2006 經營 科學 Vol.23 No.3
There are many kinds of research on web graph, most of them are focus on the hyperlinked structure of the web graph. Well known results on the web graph are rich-get-richer phenomenon, small-world phenomenon, scale-free network, etc. In this paper, we define 3 new directed web graph, so called the Web Usage Pattern Graph (WUPG), that nodes represent web sites arid arcs between nodes represent a movement between two sites by users' browsing behavior. The data to constructing the WUPG, approximately 56,000 records, are gathered from some users' PCs. The results analysing the data summarized as follows : (i) extremely rich-get-richer phenomenon (ii) average path length between sites is significantly less than the previous one (iii) less external hyperlinks, more internal hyperlinks.
Heuristics for the Access Network Design Problem in UMTS Mobile Communication Networks
김후곤(Hu-gon Kim),정용주(Yong-joo Chung),백천현(Chunhyun Paik) 한국경영과학회 2010 經營 科學 Vol.27 No.3
In this paper we study the access network design problem in Universal Mobile Telecommunication Systems (UMTS) networks. Given the location of radio base stations (node-Bs), their traffic demands, and the candidate facility centers for locating radio network controllers (RNCs), the problem is to determine the configuration of access network, including the number and location of facility centers, the number of RNCs in each facility center, and the links between RNCs and node-Bs, with the objective being to design such a network at the minimum cost. We provide a mathematical formulation of the problem with constraints on RNC and node-B capacities, along with a lower bounding method. We develop a heuristic algorithm with two different initial solution methods designed to strengthen the solution quality. The computational efficacy of their procedures is then demonstrated on a number of test problems.
트래픽별 특성 규명을 통한 인터넷 부하 측정에 관한 연구
김후곤(Hu-Gon Kim) 한국경영과학회 2009 經營 科學 Vol.26 No.1
A traffic analysis on the Internet has an advantage for obtaining the characteristics of transferred packets. There were many studies to understand the characteristics of the Internet traffic with mathematical statistical approach. The approach of this study is different from previous studies. We first introduced a virtual network concept to present the Internet as a simplified mathematical model. It also represents each traffic flowing on the Internet as a parallel Gaussian channel on the virtual network. We suggest the optimal capacity of each parallel Gaussian channel using some related studies on the Gaussian channel model.
컨테이너 터미널에서의 트랜스퍼 크레인의 최적 운영 방안에 관한 연구
김후곤(Hu Gon Kim),김철한(Chul Han Kim) 한국경영과학회 2008 한국경영과학회지 Vol.33 No.1
To load a container in a yard block onto a ship, a Transfer Crane (TC) moves to a target yard bay, then its hoist picks up a selected container and loads it onto a waiting Yard Truck (YT). An optimal routing problem of Transfer Crane is a decision problem which determines a given TC's the visiting sequence of yard-bays and the number of containers to transfer from each yard-bay. The objective is to minimize the travel time of the TC between yard-bays and setup time for the TC in a visiting yard. In this paper, we shows that the problem is NP-complete, and suggests a new formulation for it. Using the new formulation for the problem, we investigate some characteristics of solutions, a lower and upper bounds for it. Moreover, our lower and upper bound is very efficient to applying some instances suggested in a previous work.
네트워크 최적화 문제의 해결을 위한 LPSolve와 엑셀의 연동 방안
김후곤(Hu-Gon Kim) 한국산업정보학회 2010 한국산업정보학회논문지 Vol.15 No.5
네트워크 최적화 문제는 의사결정 문제 중에서 노드와 아크로 표현되는 수 많은 문제를 포함하고 있어서, 그 응용범위가 매우 다양할 뿐만 아니라 매우 실질적인 문제를 해결하는 좋은 방법론이다. 직접적으로 관련이 없는 많은 최적화 문제들도 네트워크로 적절히 표현할 수 있는 경우가 많으며, 이를 통해 보다 심도 있는 문제에 대한 이해와 해의 도출이 가능하게 된다. 이처럼 광범위한 응용분야를 가지는 네트워크 최적화 문제는 경영과학 및 산업공학에서 기본이 중요 학문이며, 이를 체계적으로 이해하고 실제 문제를 해결하려면 최적화 이론, 계산이론, 프로그래밍 등의 종합적인 지식을 필요로 한다. 본 연구에서는 네트워크 최적화 문제를 실질적으로 해결하는 필요한 지식 전달에 중점을 두고, 선형계획법 및 정수계획법을 위한 소프트웨어인 LPSo1ve를 소개하고 이 LPSo1ve와 엑셀을 연동하는 방법을 알아본다. 또한 네트워크 자체를 엑셀에서 그리는 방법을 알아보고, 이를 통해 네트워크 최적화 문제를 보다 실질적인 다룰 수 있도록 한다. We present a link that allows Excel to call the functions in the lp_solve system. 1p_solve is free software licensed under the GPL that solves linear and mixed integer linear programs of moderate size. Our link manages the interface between Excel and 1p_so1ve. Excel has a built-in add-in named Solver that is capable of solving mixed integer programs, but on1y with fewer than 200 variables. This link allows Excel users to hand1e substantially larger problems at no extra cost. Futhermore, we introduce that a network drawing method in Excel using arc adjacency lists of a network.