http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
묵시적 위치등록을 고려한 거리기준 위치등록의 모형화 및 성능 분석
이태한(Taehan Lee),서재준(Jae Joon Suh),문유리(Yu Ri Moon),백장현(Jang Hyun Baek) 대한산업공학회 2010 산업공학 Vol.23 No.4
In this study, we consider performance analysis of distance-based registration (DBR). DBR causes a mobile station (MS) to register its location when the distance between the current base station (BS) and the BS in which it last registered exceeds a distance threshold D. In general, DBR has some advantages over the other registration schemes but has a tendency to causes an MS to register more frequently than zone-based registration (ZBR) that is adopted in most of mobile communication systems. The DBR with implicit registration (DBIR) was proposed to improve the performance of DBR. In this study, we point out some problems of the previous analytical model based on continuous time Markov chain and analyze exact performance of the DBIR. We show that the DBIR always outperforms the DBR by using our exact analytical model.
양재경(Jaekyung Yang),이태한(Taehan Lee) 한국산업경영시스템학회 2010 한국산업경영시스템학회지 Vol.33 No.1
데이터마이닝의 사전 단계에서 데이터의 차원(Dimensionality)을 줄이기 위한 단계로서 많은 요소선택(Feature Selection)방법들이 개발되었다. 이 방법은 결과를 예측하거나 데이터를 설명하고자 할 때 어떤 요소들이 관련이 있는지를 결정하는 과정을 포함한다. 또한 이 방법은 데이터의 크기에 대한 확장성(Scalability)를 향상시키며 학습 모델을 더욱 이해하기 쉽도록 줄 수 있다. 이 논문에서는 NP(Nested Partition) 방법을 사용한 최적화 기반의 새로운 요소선택 방법을 NP 구조의 기본적인 이론 근거와 함께 제안한다. 또 한편으로 많은 요소선택 방법들이 다중 형태의 데이터를 처리하는데 한계를 가지고 있는데, NP 기반의 요소선택 방법에 다중 형태의 데이터를 처리할 수 있도록 하는 요소 성능 평가도구(Evaluators)를 도입하여 이를 극복하고자 한다. 또한 어떤 평가도구가 특정 데이터 형태에서 더욱 좋은 결과를 보이는지를 실험 결과와 함께 제시하였다.
페이징 에이전트를 이용한 페이징 방법의 정확한 모델링 및 성능 분석
문유리(Yu Ri Moon),이태한(Taehan Lee),백장현(Jang Hyun Baek) 대한산업공학회 2011 산업공학 Vol.24 No.1
This study considers paging schemes that can page some cells or only one cell within the location area to reduce paging cost by using PAs (Paging Agents) and compares their performances by using a new analytic method. There are three ways of paging schemes using PAs; BSPA (Base Staton Paging Agent), 2SPA (2-Step Paging Agent), LAPA (Location Area Paging Agent). This study proposes exact performance of BSPA and 2SPA using a new analytic method based on Markov chain modeling to find the most efficient paging scheme. Numerical results for various circumstances are presented by using proposed analytic method to select a proper paging scheme in mobile communication networks.
최은정,이태한,박성수 한국경영과학회 2002 한국경영과학회 학술대회논문집 Vol.- No.1(1)
We consider the heterogeneous fleet vehicle routing problem (HVRP), a variant of the classical vehicle routing problem (VRP). The HVRP differs from the classical VRP in that it deals with a heterogeneous fleet of vehicles having various capacities, fixed costs, and variables costs. Therefore the HVRP is to find the fleet composition and a set of routes with minimum total cost. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we can efficiently solve the linear programming relaxation of it by using the column generation technique. To generate profitable columns we solve a shortest path problem with capacity constraints using dynamic programming. After solving the linear programming relaxation, we apply a branch-and-bound procedure. We test the proposed algorithm on a set of benchmark instances. Test results show that the algorithm gives best-known solutions to almost all instances.