• Journal of the Korea Society for Simulation
• /
• v.8 no.4
• /
• pp.61-72
• /
• 1999

This paper presents an estimation method of container handling capacity and selection of resource allocation strategies of container terminals using the computer simulation models. Simulation models are developed to model container terminal consisting of 4 berths considering the berth allocation strategies, crane allocation strategies and the total number of container cranes using Arena simulation package. The proposed models do not consider the yard operations and gate operations. All the input parameters for the models are estimated on the basis of the existing container terminal operation data and the planning data for the automated container terminal planned by Korean government. Four berth allocation strategies and three crane allocation strategies are considered. The total number of container cranes considered ranges from 12 to 15. Non-terminating simulation techniques are utilized for the performance comparison among alternatives. The performance measures such as average ship turnaround time, average ship waiting time, average ship service time, the number of containers handled per year, and the number of ships processed per year are used. The result shows that the berth allocation strategy minimizing the sum of the number of ships waiting, the number of busy container cranes and number of ships handled performs better than any other berth allocation strategies. In addition, the crane allocation strategy allocating up to 5 container cranes per berth performs better than any other crane allocation strategies. Finally there are no significant performance differences among the alternatives consisting of different total number of container cranes allocated.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.343-348
• /
• 2006

Number of researches on efficient terminal operation system applying RFID(Radio Frequency Identification) are on progress. However, RFID has limitations on tracking and providing accurate positions of containers. In this paper, to enhance the performance of the integrated terminal operation system, an efficient loading management of yard is proposed by applying RFID-based RTLS(Real Time Locating System) that provides real-time accurate positions of containers. We found that a group-based sequence system is more efficient than the existing individual sequence number system in the container yard. In the group-based sequence system, the containers in the same group should have similar characteristics such as port of destination(POD), size, weight, etc. In order to run this system, we have proposed the parameters to the unspecified N bytes of RFID tag which are specified in ISO 18000-7. And, this paper proposed a development of integrated operation system of container terminal using RFID for reducing the ship turnaround time in ubiquitous port environment.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.19-26
• /
• 2021

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1507-1510
• /
• 2005

시스템의 한정된 자원을 다수의 사용자들에게 효율적으로 분배하기 위해서 작업관리 시스템을 사용한다. 작업관리 시스템은 그 종류가 여러 가지 있는데, 시스템의 종류나 작업의 특성에 따라서 적당한 작업관리 시스템을 사용한다. NEC 시스템에서는 작업관리 시스템으로 NQS를 사용하고 있으며, 이 작업관리 시스템을 어떻게 잘 설계하느냐에 따라 시스템 자원의 활용율이 달라지기 때문이다. 따라서 한정된 시스템의 자원을 다양한 사용자들의 작업 특징에 따라 적절히 자원을 배분 할 수 있도록 차등 큐를 설계하고 구현하였다, 그리고 작업관리 시스템 각각의 큐에서 처리된 작업의 turnaround time을 분석 하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06b
• /
• pp.13-17
• /
• 1996

This paper presents animation techniques and issues involved in virtual environments where the participants interact with each other through a network. The state of the participant should be recognized at each local site, and broadcast to the other sites. Because information exchange is minimal, animation techniques are applied to convert the incoming low DOF parameters into high DOF joint angles that completely determine the configuration of the agents at each frame. As a case study, a software system VRLOCO is introduced, which has been developed by the author over the last five years. From a simple stream of body center positions, VRLOCO generates realistic curved path human locomotion in real-time. Based on the heading direction and speed, the locomotion automatically switches among five different primitives: walking, running, lateral stepping, backward stepping, and turnaround. The techniques presented here proved robust and faithful: the algorithm is not sensitive to the noise in the data, and the resulting animation conforms well with the original data.

• Journal of the Korean Society for information Management
• /
• v.15 no.2
• /
• pp.7-28
• /
• 1998

The purpose of this study is to overview and analyze the commercial document delivery systems. to this end, the study first compared the current systems under three headings, that is, non-collection-based systems(Infotrieve, OCLC, UnCover, BIDS, Swets & Zeitlinger, Kyobobook), collection-based systems(EBSCO, ISI, UMI, BLDSC, CISTI, INIST, NCSI, JICST, KINITI), and specialized collection-based systems(Engineering Information Inc., IEEE/IEE, BIOSIS, CAS, NAL, RSC, TWI, ADONIS). Next, the study analyzeed the advantages and disadvantages of each system, based on the four performance criteria : scope of inventory/journal coverage, turnaround time, delivery ost and payment options, reliability and satisfaction rate.

• Journal of Information Processing Systems
• /
• v.7 no.4
• /
• pp.707-716
• /
• 2011

It is important that desktop grids should be able to aggressively deal with the dynamic properties that arise from the volatility and heterogeneity of resources. Therefore, it is required that task scheduling be able to positively consider the execution behavior that is characterized by an individual resource. In this paper, we implement a log analysis system with REST web services, which can analyze the execution behavior by utilizing the actual log data of desktop grid systems. To verify the log analysis system, we conducted simulations and showed that the resource group-based task scheduling, based on the analysis of the execution behavior, offers a faster turnaround time than the existing one even if few resources are used.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.60-61
• /
• 2019

Drones are opening new horizon as a major Internet-of-Things (IoT) player which is a network of objects. Drone needs to charge itself during providing services from the charging stations. If there are lots of drones and one charging station, then it is a critical situation to decide which drone should get charged first and make order of priorities for drones to get charged sequentially. In this paper, we propose an efficient scheduling algorithm for drone power charging (ESADPC), in which charging station would have a scheduler to decide which drone can get charged earlier among many other drones. Simulation results have showed that our algorithm reduces the deadline miss ration and turnaround time.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.38.2-38.2
• /
• 2021

We, on behalf of Korean Gemini Office (KGO), present the comprehensive knowledge on the Gemini Band 3 program and introduce KGO's activities to promote research of Korean community utilizing Band 3 programs. We first describe the role and realities of Band 3 programs in comparison with Band 1 and 2. Then, we will provide useful suggestions for preparing Band 3 programs and introduce a few selected cases that successfully use the Band 3 time. In addition to Band 3, we will briefly summarize other proposal opportunities including the Fast Turnaround and Poor Weather Proposals.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.1
• /
• pp.63-76
• /
• 2024

In this study, we analyzed queue length and sojourn time of discrete-time BMAP/G/1 queues under the workload control. Group customers (packets) with correlations arrive at the system following a discrete-time Markovian arrival process. The server starts busy period when the total service time of the arrived customers exceeds a predetermined workload threshold D and serves customers until the system is empty. From the analysis of workload and waiting time, distributions of queue length at the departure epoch and arbitrary time epoch and system sojourn time are derived. We also derived the mean value as a performance measure. Through numerical examples, we confirmed that we can obtain results represented by complex forms of equations, and we verified the validity of the theoretical values by comparing them with simulation results. From the results, we can obtain key performance measures of complex systems that operate similarly in various industrial fields and to analyze various optimization problems.