• Journal of Navigation and Port Research
• /
• v.41 no.3
• /
• pp.137-148
• /
• 2017

Port service level is a metric of competitiveness among ports for the operating/managing bodies such as the terminal operation company (TOC), Port Authority, or the government, and is used as an important indicator for shipping companies and freight haulers when selecting a port. Considering the importance of metrics, we developed software to objectively define and manage six important service indicators exclusive to container and bulk terminals including: berth occupancy rate, ship's waiting ratio, berth throughput, number of berths, average number of vessels waiting, and average waiting time. We computed the six service indicators utilizing berth 1 through berth 5 in the container terminals and berth 1 through berth 4 in the bulk terminals. The software model allows easy computation of expected ship's waiting ratio over berth occupancy rate, berth throughput, counts of berth, average number of vessels waiting and average waiting time. Further, the software allows prediction of yearly throughput by utilizing a ship's waiting ratio and other productivity indicators and making calculations based on arrival patterns of ship traffic. As a result, a TOC is able to make strategic decisions on the trade-offs in the optimal operating level of the facility with better predictors of the service factors (ship's waiting ratio) and productivity factors (yearly throughput). Successful implementation of the software would attract more shipping companies and shippers and maximize TOC profits.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.47-56
• /
• 2003

According to rapidly developed mobile terminals and network in the play environment for multimedia presentation, different end-to-end QoS situations appear. Then the generation of transcoding path algorithm was reviewed to transcode a source'data satisfying the needed QoS from a destination and play it considering given transcoders and network. This method used only workload as a parameter although two parameters, workload and throughput, were needed to process multimedia stream in a transcoder, Therefore generated transcoding path with this method had additional calculation to check playability whether it was safisfed the QoS of a destination or not. To solve the problem this paper suggests T algorithm with evaluation function using isochronous property that is needed for multimedia stream to arrive a destination. That means, most playable path is selected with heuristic search based isochronous property between many transcoding paths. Using the suggested algorithm, a transcoding path can be generated faster to play the multimedia data with different end-to-end QoS in real-time transmission.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1016-1022
• /
• 2010

Far-talking recognition and distributed speech recognition networking techniques are essential to control various and complex home services conveniently with voices. It is possible to control devices everywhere at home by using only voices. In this paper, we have developed the server-client DSP module for distributed speech recognition network system and proposed a new decision rule to decide intelligently whether to accept the recognition results or not by the transferred confidence rate. Simulation results show that the proposed decision rule delivers better performances than the conventional decision by majority rule or decision by first-arrival. Also, we have proposed the new interrupt-polling technique to remedy the defect of existing delay technique which always has to wait several clients' results for a few seconds. The proposed technique queries all client's status after first-arrival and decides whether to wait or not. It can remove unnecessary delay-time without any performance degradation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.717-721
• /
• 2005

With HTTP/1.0, a single request means a single HTTP connection so that the granular unit of dispatching is the same as real load. But with persistent HTTP connection, multiple requests may arrive on a single TCP connection. Therefore, a scheme that dispatches load at the granularity of individual requests constrains the feasible dispatching policies In this paper we propose a new connection dispatching polity for supporting HTTP/1.1 persistent connections in cluster-based Web servers. When the request of a base html file arrives, the dispatcher gets the subsequent load arriving on that connection using the embedded objects information. After the dispatcher stores the load information in Load Table, the dispatcher employs the connection aging strategy on live persistent connections on the passage of time. The results of simulation show about $1.7\%\~16.8\%$ improved average response time compared to existing WLC algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.11
• /
• pp.1037-1053
• /
• 1991

Flooding is known to be an effective routing mechanism not only in circuit switched networks but also packet switched networks since it minimizes the time required for up calls and does not have to maintain routing tables or distance tables by periodically intercommunicating among all the network nodes. However, one main drawback of it is the overhead on the control message signaling channels, In the paper, we propose an overlaying scheme on the existing mechanism that retains the desired properties of flooding, yet provides congestion control to the network. This is done by utilizing the wasted search messages to inform the network of the conditions of each path from one node to another. The overhead is to maintain a path table in each node. However, this overhead is not so critical. Also, this scheme can take advantages further by limiting the extent of message propagation through the network and by incorporating trunk reservation schemes additionally.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.13 no.3
• /
• pp.25-37
• /
• 2014

Recently, our local governments are conducting the introduction of tram system because it is recognized as an effective public transit that can solve a traffic jam in downtown, decreasing public transit share and environmental issues in world wide cities. We developed the Active Priority Control Strategy to efficiently operate a tram in our existing traffic signal system. This study organized the tram system for operating the Active Priority Signal Control, developed the algorithm that calculates a tram-stop dwell time in order to pass the downstream intersection without a stop. The dwell time is determined by arrival time at tram-stop, downstream signal time, and the location of a opposite tram, it can be reduced by choosing the optimal one among Signal Priority Controls. Using the VISSIM and VISVAP model, we conducted a simulation test for the city of Chang-won that it is expected to install a tram system. It showed that a developed signal control strategy is effective to prevent a tram's stop in intersections, to reduce a tram's travel time.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.31-37
• /
• 2007

The importance of NPC's role in computer games is increasing. An NPC must perform its tasks by perceiving obstacles and other characters and by moving through them. It has been proposed to plan a natural-looking path against fixed obstacles by using a generalized visibility graph. In this paper we develop the execution module for an NPC to move efficiently along the path planned on the generalized visibility graph. The planned path consists of line segments and arc segments, so we define steering behaviors such as linear behaviors, circular behaviors, and an arriving behavior for NPC's movements to be realistic and utilize them during execution. The execution module also includes the collision detection capability to be able to detect dynamic obstacles and uses a decision tree to react differently according to the detected obstacles. The execution module is tested through the simulation based on the example scenario in which an NPC interferes the other moving NPC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1B
• /
• pp.1-7
• /
• 2008

In group location management, when a transportation system(TS) with multiple mobile subscribers(MSs) changes location area(LA), location management is performed by group location registration by TS, instead of individual location registrations by MSs. In previous works, although it is assumed that LA in group location management is the same as that in individual location management, it is not appropriate to assume the same sized LAs since MSs in a TS have different characteristics from MSs which are not in a TS from the aspect of the speed and aggregate call arrival rates. Thus, in this paper, we propose an efficient location management scheme based on individual and group location managements with different sized LAs, and the performance of the proposed scheme is analyzed from the aspect of signaling cost at the wireless interface. Results reveal that the proposed scheme outperforms the conventional scheme by selecting an appropriate sized LA for group location management.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.227-234
• /
• 2018

Guaranteeing the end-to-end delay deadline is an important issue for quality of service (QoS) of delay sensitive systems, such as real-time system, networked control system (NCS), and cyber-physical system (CPS). Most routing algorithms typically use the mean end-to-end delay as a performance metric and select a routing path that minimizes it to improve average performance. However, minimum mean delay is an insufficient routing metric to reflect the characteristics of the unpredictable wireless channel condition because it only represents average value. In this paper, we proposes a deadline-aware routing algorithm that maximizes the probability of packet arrival within a pre-specified deadline for CPS by considering the delay distribution rather than the mean delay. The proposed routing algorithm constructs the end-to-end delay distribution in a given network topology under the assumption of the single hop delay follows an exponential distribution. The simulation results show that the proposed routing algorithm can enhance QoS and improve networked control performance in CPS by providing a routing path which maximizes the probability of meeting the deadline.

• Fire Science and Engineering
• /
• v.31 no.5
• /
• pp.107-116
• /
• 2017

Fires in tunnels are an international concern and fatal accidental fires in tunnels seem to occur on annual. They have the potential to become much worse int the future as more and longer tunnels are constructed and as traffic densities increase. This is a serious problem. The main purpose of this study is to develop operational procedures for fire brigades in road tunnel fires. This study discussed the past to see what can be learned from the incidents that have already done in tunnels. 73 cases of road tunnel fires domestic and outside of Korea were investigated and classified into 4 incident categories. Among them, 4 tunnel fires are highlighted, focusing on the activities of fire brigades and operation. Regarding the establishment of the strategies for fire fighting, 6 kinds of fire scenario curves have been deducted with regard to the relation between intervention time and heat release rate. It made the choice from the defensive or aggressive fire fighting activities depending on two criteria i.e. response limit and maximum response time. Road Tunnel Classification models can be useful when a fire brigade evaluates fire risk levels in the tunnels under its jurisdiction from the firefighting point of view and sets up preventive measures.