• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.169-173
• /
• 2014

Nobody has yet been able to determine the optimal solution conclusively whether NP-complete problems are in fact solvable in polynomial time. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming with $O(m^4)$ time complexity for barge loading problem a kind of bin packing problem that is classified as nondeterministic polynomial time (NP)-complete problem. On the other hand, this paper suggests the loading rule of profit priority rank algorithm with O(m log m) time complexity. This paper decides the profit priority rank firstly. Then, we obtain the initial loading result using the rule of loading the good has profit priority order. Finally, we balance the loading and capability of barge swap the goods of unloading in previously loading in case of under loading. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m log m) time complexity for NP-complete barge loading problem.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2005.10a
• /
• pp.255-261
• /
• 2005

The purpose of this paper is to analyze transport ability of Automated Guided Vehicle(AGV) and Double Stack Vehicle(DSV) at Automated Container Terminal(ACT). Usually, the main difference of AGV and DSV is capacity of container that they can transport between apron and yard block at once. AGV can carry out two 20 feet or one 40 feet maritime containers, but DSV can carry out four 20 feet or two 40 feet maritime containers. Therefore, DSV may improve more efficiency of stevedoring system of container terminal. In this paper, a simulation model using a graphics simulation system is developed to compare the proposed DSV with the current AGV at automated container terminal. The paper includes examples, performance tests and a discussion of simulation results.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.41-41
• /
• 1991

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.13-17
• /
• 2003

본 논문에서는 낮은 대역폭, 높은 지연, 그리고 잦은 네트워크 단절로 인한 모바일 컴퓨팅 환경의 문제점들을 해결하기 위한 효과적인 캐시 적재 기법으로서 협업 추천 기반의 데이터 마이닝 전략을 제안하였다. 캐시 적재가 모바일 클라이언트의 이러한 문제점들을 해결하기 위한 효율적인 방법이 된다는 기존의 연구는 많이 진행되어 왔다. 하지만 모바일 컴퓨터의 요구에 대한 이력 정보만을 이용한 기존의 연구는 모바일 클라이언트가 필요로 하는 모든 정보 요구를 만족하지 못하였다. 특히 저장 공간의 제약을 갖는 모바일 컴퓨터의 한계 때문에 더욱 큰 어려움을 갖게 되었다. 본 연구에서는 모바일 클라이언트의 이력 정보에 대하여 데이터 마이닝 기법을 적용한 캐시 적재 기법을 제안하여 적은 캐시 용량만으로도 모바일 클라이언트의 요구를 만족할 수 있는 아이템들을 효과적으로 서비스할 수 있도록 하였다. CSIM Simulator를 이용하여 모의 데이터를 생성하여, 제안 모형의 성능 평가를 위한 실험을 수행하였다. Cache hit ratio를 이용한 객관적인 성능 평가를 통하여 제안된 모형이 모바일 클라이언트의 캐시 적재 기법으로서 우수한 성능을 보임이 확인되었다.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.2
• /
• pp.131-136
• /
• 2015

The chemical tank loading problem has been classified as nondeterministic polynomial time (NP)-complete problem because of the polynomial-time algorithm to find the solution has been unknown yet. Gu$\acute{e}$ret et al. tries to obtain the optimal solution using linear programming package with $O(m^4)$ time complexity for chemical tank loading problem a kind of bin packing problem. On the other hand, this paper suggests the rule of loading chemical into minimum margin tank algorithm with O(m) time complexity. The proposed algorithm stores the chemical in the tank that has partial residual of the same kind chemical firstly. Then, we load the remaining chemical to the minimum marginal tanks. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m) time complexity for NP-complete chemical tank loading problem.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.6
• /
• pp.687-692
• /
• 2004

In this paper, we proposed an efficient cache hoarding method in mobile computing environments using collaborative filtering. This method is used for solving the difficult problem of mobile computing, which is the vacuum of information service depending on low bandwidth, long delay, and frequent network disconnection. Many previous researches have been studied a cache hoarding approach for solving these problems of mobile client. But, the research of history information of mobile client did not support all informative requests for mobile clients. In our research, collaborative filtering model using history information and location data of mobile client is proposed. This proposed model supports an efficient service of necessary items for client's requirement. For the performance evaluation of proposed model, we make an experiment of simulation data using SAS enterprise miner. According to objective evaluation using cache hit ratio, we show that our model has a good result.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.7-18
• /
• 2001

This study represents a first attempt in Korea to develop the simultaneous freight supply-demand model which considers the relationship between freight supply and demand. As the existing study was limited in one area, or the supply and the demand was separated and assumed not to affect each other, this study take it into consideration the fact that the demand affects supply and simultaneously vice versa. This approach allows us to diagnose a policy carried on and helps us to make a resonable alternative for the effectiveness of freight transportation system. To find a relationship between them, we use a method of econometrics. a structural equation theory and two stage least-squares(2SLS) estimation technique, to get rid of bias which involves two successive applications of OLS. Based on the domestic freight data, this study consider as explanatory variables a number of population(P), industry(IN), the amount of production of the mining and manufacturing industries(MMI), the rate of the effectiveness of freight capacity(LE) and the distance of an empty carriage operation(VC). This study describes well the simultaneous process of freight supply-demand system in that the increase of VC from the decrease of VC raises the cargo capacity and cargo capacity also augments VC. By the way. it is analyzed that the increment of VC due to the increase of the cargo capacity is larger than the reduction of VC owing to the increase of the quantify of goods. Therefore an alternative policy is needed in a short and long run point of view. That is to say, to promote the effectiveness of the freight transportation system, a short term supply control and a long run logistic infrastructure are urgent based on the restoration of market economy by successive deregulation. So we are able to conclude that gradual deregulation is more desirable to build effective freight market.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.61-63
• /
• 2015

본 논문에서는 애플리케이션 실행에 필요한 파일들을 검출하고, 그 파일들을 저 용량의 비 휘발성 메모리에 옮겨 시작 시간을 단축시킨다. 또한 각각의 파일들은 전체가 필요하지 않고 파일 중 일부분만 필요하기 때문에, 필요한 부분만 주 메모리에 선 적재 함으로써 시작 시간을 크게 개선하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1591-1594
• /
• 2010

NAND 플래시 메모리 기반의 Solid State Disk (SSD)의 내부에는 Flash Translation Layer (FTL)이라는 소프트웨어가 사용되고 있다. FTL은 파일 시스템으로부터 요청되는 논리 주소를 플래시 메모리의 물리 주소로 변환하며 이를 위하여 사상 테이블을 사용한다. 사상 테이블의 빠른 접근을 위하여 사상 테이블은 SSD 내부의 RAM에 유지하는데 SSD의 용량이 커지게 되면 사상 테이블로 인해 요구되는 RAM의 크기도 커지는 문제점이 있다. 본 논문에서는 FTL의 사상 테이블을 페이지 단위로 나누어 필요할 때마다 RAM에 적재하는 다단계 사상 테이블 기법을 연구하였다.

• Journal of Korea Multimedia Society
• /
• v.14 no.9
• /
• pp.1165-1174
• /
• 2011

In data broadcasting systems, servers continuously disseminate data items through broadcast channels, and mobile client only needs to wait for the data of interest to present on a broadcast channel. However, because broadcast channels are shared by a large set of data items, the expected delay of receiving a desired data item may increase. This paper explores the issue of designing proper data allocation on multiple broadcast channels to minimize the average expected delay time of all data items, and proposes a new data allocation scheme named two level bin-packing(TLBP). This paper first introduces the theoretical lower-bound of the average expected delay, and determines the bin capacity based on this value. TLBP partitions all data items into a number of groups using bin-packing algorithm and allocates each group of data items on an individual channel. By employing bin-packing algorithm in two step, TLBP can reflect a variation of access probabilities among data items allocated on the same channel to the broadcast schedule, and thus enhance the performance. Simulation is performed to compare the performance of TLBP with three existing approaches. The simulation results show that TLBP outperforms others in terms of the average expected delay time at a reasonable execution overhead.