• Journal of Navigation and Port Research
• /
• v.27 no.4
• /
• pp.403-407
• /
• 2003

A basic concept of TAS(Tractor Appointment System), which not only enhances the terminal productivity, but also yields higher efficiency of domestic CT(Container Terminal), is developed in this paper for CT to more competitive and serviceable. To analyze the effects of TAS when applied to the existing four-tier CT, a quantitative analysis is performed. The results showed that the number of rehandling time of CT has been significantly decreased, the efficiency of CT increased, and the flow time of trucks in CT reduced in a great deal

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.206-210
• /
• 2008

The most noticeable aspect of progressive streaming is the media playback during its download through TCP to avoid a lengthy wait for a content to finish downloading. By employing TCP, it is usually possible to detect lost packets by using the checksum and sequence numbering functions of TCP Thereafter, we can recover the lost packets by the retransmission function of TCP. However, there must remain enough amount of media data in the recipient buffer in order to guarantee seamless media playback even during retransmission. In this paper, we propose an efficient algorithm for determining the initial buffering time before start of playback to guarantee seamless playback during retransmission considering the probability of client buffer under-flow. The effectiveness of the proposed algorithm will be proved through extensive simulation results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.840-845
• /
• 2005

Intelligent agents to learn users' tendency have learn uscrs' tendency by sufficient users information and training time. When the intelligent agents is used in ubiquitous environment, users must wait for intelligent agents to learn, so user may be can't get proper services. In this paper we proposed an intelligent P2P mobile agent system that can learn users' tendency in real-time by sharing users' resource. The system shared users contexts on four places and made feel groups which was composed of similar users. When users' service which had the highest correlation coefficient in the peer groups was suggested, users were satisfied over $80\%$.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.961-970
• /
• 2003

In data broadcasting environments, the server periodically broadcasts data items in the broadcast channel. When each client wants to access any data item, it should monitor the broadcast channel and wait for the desired item to arrive. Client data caching is a very effective technique for reducing the time spent waiting for the desired item to be broadcastted. This paper proposes a new client cache management scheme, named LRU-CFP, to reduce this waiting time ans evaluates its performance on the basis of a simulation model. The performance results indicate that LRU-CFP scheme shows superior performance over LRU, GRAY and CF in the average response time.

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.9-21
• /
• 2002

In data broadcasting environments, the server periodically broadcasts data items in the database through the broadcast channel. When each client wants to access any data item, it should monitor the broadcast channel and wait for the desired item to arrive. Client data caching is a very effective technique for reducing the time spent waiting for the desired item to be broadcasted. This paper proposes a new client cache management scheme, named 2Q-CF, to reduce this waiting time and evaluate its performance on the basis of a simulation model. The performance results indicate that 2Q-CF scheme shows superior performances over LRU-CF and CF in the average response time.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.157-164
• /
• 2008

In this paper we suggest a scheduling algorithm that transmits periodic traffics efficiently in tree-structured wireless sensor networks (WSNs). The related research[l] showed the problems such as increasing the energy consumption and decreasing the data throughput as the depth of tree increases. To solve these problems. we use idle time slots and avoid the redundancy at data transmission. Also we suggest the algorithm that transmits the control packet when it is similar to a previously measured data. And if emergency data is occurred, our proposed algorithm transits that data in EDP(Emergency Data Period) for reducing the wait time. The proposed algorithm shows more data throughput and less energy consumption than that of the related research.

• Journal of the Korean Society for Library and Information Science
• /
• v.51 no.2
• /
• pp.237-253
• /
• 2017

There are many systematic approaches to manage Interlibrary loan (ILL) efficiently. In this paper, we propose an operating method reducing user-waiting in ILL. Users are usually informed to wait around two to three days in a regional ILL service. The reason of the waiting is that there is inefficiency in running material-delivery vehicles. A mixed integer programming is employed to resolve this issue. It provides an optimal vehicle-route maximizing material-deliveries subject to time availability. We used an actual data of a regional ILL system to provide optimal vehicle routes under different time settings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3470-3493
• /
• 2019

IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

• Journal of Korean Academy of Fundamentals of Nursing
• /
• v.25 no.4
• /
• pp.250-258
• /
• 2018

Purpose: This study was done to assess the influence of application time of Lidocaine patch on pain intensity following venipuncture in hospital. Methods: The participants were 31 adult patients admitted to J hospital in G city. Patients' anxiety, blood pressure and pulse were measured when no patch was applied and when a patch was applied. To evaluate the pain intensity and physiological index caused by venipuncture, blood pressure, pulse and pain intensity were checked for patients in the no patch group, and for a 5 minutes of application and 30 minutes application patch. Pain was evaluated using a visual analogue scale, anxiety using the Profile of Mood states developed McNair et al. and modified by Lee. Data were analyzed using one-way repeated measures ANOVA with the SPSS 21.0 program. Results: Anxiety and pain were significantly reduced when a lidocaine patch was applied following venipuncture. There was no significant difference in pain intensity whether the lidocaine patch application is for 30 minutes or application for 5 minutes. Conclusion: Results of this study show that application of lidocaine patch can be used as a nursing intervention for pain reduction by showing that there is no need to wait a long time for pain to be reduced.

• Korea Journal of Hospital Management
• /
• v.15 no.3
• /
• pp.47-68
• /
• 2010

One of the important complaint factors by the patients using medical institutions is various kinds of waiting time. This research is about the causal relationships among waiting time(application of waiting time, perceived of waiting time, fairness of waiting, explanation of the delay, acceptance possibility), service values, and customer satisfaction. The subjects for this study were 256 out-patients currently using seven general hospitals in the Busan area. The findings of the empirical analysis are as follows: First, the good application of waiting time or fair waiting time procedure didn't actually affect perceived waiting time. Second, though the application of waiting time didn't affect acceptance possibility, the fair procedure of waiting time had an affirmative effect on acceptance possibility. Third, even when there was enough explanation about the need to wait, it could shorten perceived waiting time but failed to get sufficient sympathy or agreement from the patients. Fourth, the possibility of acceptance following the sufficient sympathy of patients had an effect on shortening perceived waiting time. Fifth, perceived waiting time lowered customer satisfaction, but had no negative effect on service values. Finally, the ranges of acceptance possibility by the patients were found to increase customer satisfaction and maximize service values. In conclusion, every medical institution needs to focus on, first of all, shortening waiting time for more customer satisfaction and improved service values.