• KDI Journal of Economic Policy
• /
• v.18 no.2
• /
• pp.117-183
• /
• 1996

공기업(公企業) 비효율성(非效率性)의 근본원인을 소유구조상(所有構造上)의 문제, 경쟁부재(競爭不在)의 문제, 지나친 정부규제(政府規制)의 문제로 이해할 때 그동안 공기업관련(公企業關聯) 정책(政策)이 소유구조상의 해결책인 민영화정책(民營化政策)에만 지나치게 편중됨으로써 경제력집중(經濟力集中)이나 증시문제(證市問題) 등으로 인해 공기업(公企業) 비효율성(非效率性)의 치유가 오히려 지연되고 있다는 시각에서 본고는 출발하고 있다. 시장기능(市場機能)의 활성화를 통한 효율성제고(效率性提高)가 공기업정책(公企業政策)의 궁극적인 목표라고 할 때 공기업의 비효율성(非效率性) 문제는 공기업관련(公企業關聯) 산업(産業)의 경쟁정책적(競爭政策的) 차원에서 문제점들을 파악하고 해결책을 모색할 필요가 있다. 따라서 공기업분야에 시장기능(市場機能)이 정착되기 위해 민영화(民營化), 경쟁도입(競爭導入), 규제완화(規制緩和) 등의 효율성 제고수단들의 총체적이고 유기적인 연계가 필수적이다. 이러한 시각에서 본고는 민영화 등 공기업관련(公企業關聯) 경쟁정책(競爭政策)중 구조적(構造的)인 측면을 주로 살펴보고 있다. 공기업(公企業)의 비효율성(非效率性)을 공기업 자체의 내적(內的) 비효율성(非效率性)과 시장에서의 배분적(配分的) 비효율성(非效率性)으로 구분할 때, 내적 비효율성 못지않게 배분적(配分的) 비효율성(非效率性)이 심각한 것으로 보인다. 한국통신(韓國通信) 등 대표적 공기업 6개와 10대(大) 민간(民間) 대기업집단(大企業集團)의 수익률(收益率) 비교(比較) 등에 따르면 이들 공기업이 독점적(獨占的) 시장구조하(市場構造下)에서 민간독점기업적(民間獨占企業的) 행태를 취해 왔다고 판단된다. 한편 상대적으로 경쟁도입이 활성화되고 있는 통신산업(通信産業)의 경우 요금의 변화추이는 경쟁도입(競爭導入)이 배분적(配分的) 효율성(效率性)을 증진시키고 있는 것으로 나타나고 있어 시장구조(市場構造)를 경쟁적으로 변화시키는 것이 공기업정책(公企業政策)에서 절실하다고 판단된다. 구조적(構造的)인 경쟁정책(競爭政策)을 다루기 위해 본고는 사업다각화(事業多角化)라는 시각에서 6대(大) 공기업관련산업(公企業關聯産業)의 산업련관분석(産業聯關分析)을 통해 공기업이 상당한 전후방효과(前後方效果)를 갖고 있기 때문에 단순 민영화에 따른 수직적(垂直的) 독점력(獨占力) 확산을 고려하면서 구조적(構造的) 정책(政策)을 취할 필요가 있음을 지적하고 있다. 따라서 독점공기업(獨占公企業)을 민영화함에 있어서 시장구조를 보다 경쟁적(競爭的)으로 전환시킬 필요성이 크다고 판단된다. 1993년 민영화계획(民營化計劃)의 범위가 불충분하고 그 계획조차 지연되는 현상황을 고려할 때 민영화정책의 보다 강력하고 광범위한 실행이 필요할 뿐만 아니라 공기업분야에 경쟁적(競爭的) 시장구조(市場構造)가 정착될 수 있도록 유도하는 것이 공기업 관련 구조적(構造的)인 경쟁정책(競爭政策)의 핵심이라고 본다. 또한 본 논문은 공기업이 원래의 설립목적(設立目的) 이외의 다른 사업분야에 진출하는 것을 허용할 것인가에 대하여 구조적(構造的) 경쟁정책차원(競爭政策次元)에서 기본방향을 제시하고 있다.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.391-399
• /
• 2008

RSS is the XML-based format for the syndication of web contents, and users aggregate RSS feeds with RSS feed aggregators. In order to effectively aggregate RSS feeds, an RSS aggregation policy is necessary. In this paper, we first propose an aggregation policy to minimize the number of postings being missed within an aggregation. Second, we analyze and compare our aggregation policy with existing aggregation policies. Our analysis reveals that our aggregation policy can reduce approximately 23% of the aggregation missing in comparison with the other aggregation policies while it increases only 6% of the aggregation delay.

• Journal of the Korea Society for Simulation
• /
• v.20 no.3
• /
• pp.29-39
• /
• 2011

The appointment system is widely used to facilitate customer access to service in many industries including healthcare and others. Because of its importance, much research has investigated how to build an effective appointment policy under various environments. However, most research has considered a single-server service system. The objective of this work is to evaluate several appointment policies in a two-stage service system in which multiple servers are available and build separate appointments at the second-stage. In such a system, we propose and evaluate the staggering appointment policy. Simulation experiments indicate that the proposed staggering appointment policy outperforms other traditional appointment policies in terms of customer waiting time, server idle time, and the number of customers who are later to scheduled appointments.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.753-757
• /
• 2008

In this paper, we propose a new scheduling strategy for dynamic programming in Grid environment. The key idea of this scheme is to reduce the execution time of a job by dividing the dynamic table based on the locality of table and allocating jobs to nodes which minimize network latency. This scheme obtains optimal concurrency by constructing the dynamic table using a distributed top down method. Through simulation, we show that the proposed Grid strategy improves the performance of Grid environment compared to previous branch-bound strategies.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2011.08a
• /
• pp.115-122
• /
• 2011

공공도서관은 지역주민의 다양한 정보요구와 관심사를 충족시키기 위해 필요한 각종 정보자료를 광범위하게 구성하여야 한다. 이렇듯 공공도서관은 방문하는 이용자들의 배경이 다양하고 도서관을 찾는 목적 또한 다양하기 때문에 모든 이용자의 요구를 충분히 만족시키기에 어려움을 겪고 있으며, 이를 극복하기 위한 노력으로 공공도서관 자료의 만족 수준을 높일 수 있는 장서개발정책 연구가 필요하다. 이에 따라 본 연구는 공공도서관의 장서개발정책을 제안하기 위해 서울특별시 소재 구립 공공도서관 10개관 이용자들을 대상으로 설문조사를 실시하여 이용자의 장서 이용 행태를 파악하고, 이를 바탕으로 서울시 구립 공공도서관을 위한 장서개발정책을 제안한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.556-568
• /
• 2003

This paper presents and analyzes the performance of a weighted-window based cache replacement policy for the efficient media caching in streaming media cache servers. The proposed policy makes, for each cached object, use of the reference count, reference time, amount of media delivered to clients and, in particular, the periodic patterns of user requests. Also, by giving weights to the recently referenced media contents, the replacement policy adequately and swiftly reflects the ever-changing characteristics of users preferences. The simulation studies show that the performance of the proposed policy has improved over the conventional policies such as LRU, LFU and SEG - in terms of hit ratio, byte hit ratio, delayed start and cache input.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.634-641
• /
• 2006

Flash memory has many advantages like non-volatility and fast I/O speed, but it has also disadvantages such as not-in-place-update data and asymmetric read/write/erase speed. For the performance of flash memory storage, it is essential for the buffer replacement algorithms to reduce the number of write operations that also affects the number of erase operations. A new buffer replacement algorithm is proposed in this paper, that delays the writes of not-cold-dirty pages in the buffer cache of flash storage. We show that this algorithm effectively decreases the number of write operations and erase operations without much degradation of hit ratio. As a result overall performance of flash I/O speed is improved.

• Journal of the Korean Society for Library and Information Science
• /
• v.42 no.4
• /
• pp.269-290
• /
• 2008

The aim of this research was to find ways to improve the overall school library management quality and also to help finding solutions to the school library related problems, which could have not been dealt by the individual schools. To achieve the research goal, we analyzed the domestic and foreign cases of the government led supports for the school libraries as well as collaborations between the school libraries and other organizations. We surveyed the principals about the school library operating policies, current status, and requirements as the principals have influence over how the school libraries are managed. One of the findings of the research was that the survey respondents devote their efforts in the collection development but they also required training of the school library staffs. In comparison to the metropolitan and rural areas, the school libraries in the middle to small cities experienced variety of problems in all aspects of their operations. In addition, the middle to small city school libraries had high expectation on the government supports.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.12
• /
• pp.1174-1185
• /
• 2012

This paper proposes a call admission control scheme for delay guarantee in the wireless mesh networks. The admission of a new call is determined based on the expected delay inferred from the class level available bandwidth at nodes on the path. All nodes under the effects of the new call are considered in designing the call admission control scheme to maintain the delay guarantee of the pre-existing traffic. An effective technique for estimating the available bandwidth of the neighbor nodes is proposed with no addition of message interchanges. The class-level delay control is mainly performed by the queueing discipline while keeping the MAC operation simple. Simulations are performed to show the validity of the proposals. We observe acceptable performances in delay expectation with the addition of new calls. We also show that the proposed call admission control is helpful in guaranteeing the delay performances.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.523-532
• /
• 2001

A Critical issue in the performance of a video-on-demand system is the required I/O bandwidth of the Video server in order to satisfy clients requests, and it is the crucial resource that may cause delay increasingly. Several approaches such as batching and piggybacking are used to reduce the I/O demand on the video server through sharing. Bathing approach is to make single I/O request for storage server by grouping the requests for the same object. Piggybacking is th policy for altering display rates of requests in progress for the same object to merge their corresponding I/O streams into a single stream, and serve it as a group of merged requests. In this paper, we propose a reservation-based hybrid disk bandwidth reduction policy that dynamically reserves the I/O stream capacity of a video server for popular videos according to the loads of video server in order to schedule the requests for popular videos immediately. The performance of the proposed policy is evaluated through simulations, and is compared with that of bathing and piggybacking. As a result, we know that the reservation-based hybrid disk bandwidth reduction policy provides better probability of service, average waithing time and percentage of saving in frames than batching and piggybacking policy.