• Quality Improvement in Health Care
• /
• v.12 no.2
• /
• pp.75-83
• /
• 2006

Background : Utilization review has been adopted as a vehicle for cost and utilization control of health care services. Its role was further stressed and expanded through the establishment of Health Insurance Review Agency in 2001. This article is to introduce concept, activities, and effect of utilization review based on the experiences of U.S. and to suggest important characteristics for ideal utilization review activities at the national level in Korea. Method : Twenty-five articles related with utilization review were reviewed after being selected through web site search through Med Line and Richis. Result : Utilization review was introduced mainly for health care expenditure control either by insurer, provider or the third parties under the pressure of increasing health care cost. It's activities can be categorized to prospective, concurrent and retrospective review according to the time of service provision. Based on most of studies, utilization review has been effective in controling rising health care cost and utilization. However it's effectiveness assumes a reimbursement structure of managed care like capitation payment. More worse, it is still unknown it's effectiveness on quality of care. Conclusion : Utilization review should be employed to increase the cost effectiveness of medical care by optimizing quality and patient's outcomes while also attempting to reduce the use of resources. So, it should consider outcomes before expenditures, check for both under and over-use, and construct an structure in which consumption is reduced equitably. Aggressive adoption of utilization review in Korean health care setting with fee-for-service reimbursement structure might not be a cost-effective approach before adoption of prospective payment system such as D.R.G. and capitation.

• Korean Management Science Review
• /
• v.28 no.2
• /
• pp.17-29
• /
• 2011

The purpose of this paper is to schedule elective surgery patients using a stochastic programming approach and to illustrate how operating room utilization behaves when a decision-maker varies costs associated with utilization. Because of the uncertainty in surgery durations, the underage and overage costs that a decision-maker considers plays an important role in allocating surgery cases into available operating room capacity. We formulate the problem as a stochastic mixed integer programming and propose a sampling-based approximation method for a computational purpose. Newsvendor model is employed to explain the results from numerical experiments that are conducted with the actual data from a hospital. The results show that the operating room utilization is more sensitive when the unit overtime cost is relatively larger than the unit cost for underutilized time.

• Asia pacific journal of information systems
• /
• v.25 no.3
• /
• pp.519-539
• /
• 2015

Customers are now demanding ever better service from customer service representatives (CSRs) to create superior customer service. Accordingly, CSRs are required to have more specialized knowledge and abilities of customer service. This study examines the roles of accumulated customer knowledge in electronic knowledge repositories (EKRs), which a firm has developed for customer service over time to enhance CSRs' work capabilities and work performance, in the context of call centers. To test the proposed research model and hypotheses, we conducted LISREL analysis using 261 responses collected on CSRs working for inbound call centers. The key results are as follows. First, accumulated customer knowledge in EKRs enhances CSRs' knowledge utilization and service expertise during the customer contact. Second, CSRs' knowledge utilization reinforces service expertise. Finally, service quality depends on CSRs' knowledge utilization and service expertise, but it is not directly related to accumulated customer knowledge. Overall, the findings suggest that accumulated customer knowledge in EKRs enhances CSRs' knowledge utilization and service expertise, and thereby leading to superior service quality.

• Journal of Microbiology and Biotechnology
• /
• v.25 no.6
• /
• pp.814-819
• /
• 2015

The natural crosslinking agent genipin has been applied widely in biomedicines and foods nowadays. Because of the special hemiacetal ring structure in its molecule, it can only be prepared by hydrolysis of geniposide according to biocatalysis. In this research, strategies including aqueous-organic biphasic catalysis and substrate fed-batch mode were adopted to improve the biocatalysis process of genipin. A 10 L ethyl acetate-aqueous biphasic system with geniposide fed-batch led to a satisfying genipin yield. With Fusarium solani ACCC 36223, 15.7 g/l genipin in the ethyl acetate phase was obtained, corresponding to space-time yields of 0.654 g l^-1 h^-1.

• Asian Journal of Innovation and Policy
• /
• v.12 no.2
• /
• pp.200-215
• /
• 2023

The purpose of this paper is to analyze the Korean government's investment priorities for the establishment of a supercomputer joint utilization system using AHP. The AHP model was designed as a two-layered structure consisting of two areas of specialized infrastructure, a one-stop joint utilization system service, and four evaluation items for detailed tasks. For the weight of each evaluation item, a cost efficiency index considering the annual budget was developed for the first time and applied to the weight calculation process. AHP analysis conducted a survey targeting supercomputer experts and derived priorities with 22 data that had completed reliability verification. As a result of the analysis, the government's investment priority was high in the order of dividing infrastructure for each Specialized Center and building resources in stages. In the future, the analysis results will be used to select economic promotion plans and prepare strategies for the establishment of the government's supercomputer joint utilization system.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.535-544
• /
• 2003

Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.

• The Korean Nurse
• /
• v.20 no.3 s.111
• /
• pp.58-65
• /
• 1981

It is desirable to utilize the community health resources to manage community health services effectively with limited personnel, time and facilities. This study was conducted to determine the utilization of community health resources. During the period o

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.489-496
• /
• 2002

This study proposes a new polling algorithm allowing dynamic change in polling period based on line utilization prediction. Polling is the most important function in network monitoring, but excessive polling data causes rather serious congestion conditions of network when network is In congestion. Therefore, existing multiple polling algorithms decided network congestion or load of agent with previously performed polling Round Trip Time or line utilization, chanced polling period, and controlled polling traffic. But, this algorithm is to change the polling period based on the previous polling and does not reflect network conditions in the current time to be polled. A algorithm proposed in this study is to predict whether polling traffic exceeds threshold of line utilization on polling path based on the past data and to change the polling period with the prediction. In this study, utilization of each line configuring network was predicted with AR model and violation of threshold was presented in probability. In addition, suitability was evaluated by applying the proposed dynamic polling algorithm based on line utilization prediction to the actual network, reasonable level of threshold for line utilization and the violation probability of threshold were decided by experiment. Performance of this algorithm was maximized with these processes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3663-3679
• /
• 2020

Scheduling plays a dynamic role in cloud computing in generating as well as in efficient distribution of the resources of each task. The principle goal of scheduling is to limit resource starvation and to guarantee fairness among the parties using the resources. The demand for resources fluctuates dynamically hence the prearranging of resources is a challenging task. Many task-scheduling approaches have been used in the cloud-computing environment. Security in cloud computing environment is one of the core issue in distributed computing. We have designed a deep learning-based security model for scheduling tasks in cloud computing and it has been implemented using CloudSim 3.0 simulator written in Java and verification of the results from different perspectives, such as response time with and without security factors, makespan, cost, CPU utilization, I/O utilization, Memory utilization, and execution time is compared with Round Robin (RR) and Waited Round Robin (WRR) algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.475-490
• /
• 2010

Cognitive Radio is an advanced enabling technology for the efficient utilization of vacant spectrum due to its ability to sense the spectrum environment. It is important to determine accurate spectrum utilization of the primary system in a cognitive radio environment. In order to define the spectrum utilization state, many CR systems use what is known as the quiet period (QP) method. However, even when using a QP, interference can occur. This causes reduced system throughput and contrary to the basic condition of cognitive radio. In order to reduce the interference time, a frequency-hopping algorithm is proposed here. Additionally, to complement the loss of throughput in the FH, a HMM-based channel prediction algorithm and a channel allocation algorithm is proposed. Simulations were conducted while varying several parameters. The findings show that the proposed algorithm outperforms conventional channel allocation algorithms.