• Journal of Environmental Impact Assessment
• /
• v.20 no.5
• /
• pp.585-600
• /
• 2011

South Korean central government has launched the first comprehensive climate change policies in 1999, and they have been renewed every three year. The third policies ended in 2007. However, it is quite rare to analyze whether the climate change policies are effective against climate change. In this context, this paper aims at analyzing the effectiveness of climate change policy which was launched for seven years from 1999 to 2007 in South Korea. The effectiveness analysis of policy can be done in terms of the individual policy and/or all policies being synthesized as a comprehensive unit. Employing the latter methodology, this paper analyzed the effectiveness on the basis of economic growth as independent variable, greenhouse gas emission as dependent variable, and energy use and its process as intervening variable. Seven analytic indicators covering the three variables were selected on the basis of two points in time before and after climate change policy having been launched. The seven indicators were analyzed in terms of three aspects. They were the change in the state of each indicator, the effectiveness of climate change policy from 1999 to 2007, and the effectiveness process from 1999 to 2007. The effectiveness process was analyzed in terms of the relational context and its flow processing path. Economic growth was advanced remarkably with increase in the total consumption of energy. As a result, greenhouse gas emission increased. However, energy efficiency increased with significant decrease in energy intensity, carbon intensity, and energy elasticity. The expansion of new and renewable energy over total energy supply was not effective significantly on the decrease in greenhouse gas emission. The processing path of climate change policy being effective advanced toward increase in energy efficiency through energy intensity rather than toward sustainable development. Such a way of the effectiveness of climate change policy implies that most policies focused on adaptation rather than on mitigation.

• Food Science and Industry
• /
• v.44 no.1
• /
• pp.21-27
• /
• 2011

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.2
• /
• pp.305-312
• /
• 2020

The Privacy Act stipulates that the privacy policy document, which is a privacy statement, should be disclosed in order to guarantee the rights of the information subjects, and the Fair Trade Commission considers the privacy policy as a condition and conducts an unfair review of the terms and conditions under the Terms and Conditions Control Act. However, the information subjects tend not to read personal information because it is complicated and difficult to understand. Simple and legible information processing policies will increase the probability of participating in online transactions, contributing to the increase in corporate sales and resolving the problem of information asymmetry between operators and information entities. In this study, complex personal information processing policies are analyzed using deep learning, and models are presented for acquiring simplified personal information processing policies that are highly readable by the information subjects. To present the model, the personal information processing policies of 258 domestic companies were established as data sets and analyzed using deep learning technology.

• Journal of the Korea Society for Simulation
• /
• v.10 no.1
• /
• pp.35-50
• /
• 2001

Managing multi-echelon inventory systems has gained importance over the last decade mainly because integrated control of supply chains consisting of several processing and distribution stages has become feasible through modern information technology. Determination of optimal inventory policy for multi-echelon supply chain is made difficult by the complex interaction between the different levels. In this paper, we investigate performance of five inventory policies (fixed quantity order policy, fixed interval order policy, compromised order policy, lead time-fixed quantity order policy, and mixed order policy) in a multi-echelon supply chain by using a simulation model constructed with AweSim simulation language. The results of the simulation study show that the mixed order policy is the best among five inventory policies in the most test problems except the case when the stockout cost per unit is much higher than the inventory holding and transportation costs per unit.

• Journal of Internet of Things and Convergence
• /
• v.8 no.4
• /
• pp.9-15
• /
• 2022

NAND flash memory is used as a medium for various storage devices due to its high data processing speed with low power consumption. However, since the read processing speed of data is about 10 times faster than the write processing speed, various studies are being conducted to improve the speed difference. In particular, flash dedicated buffer management policies have been studied to improve write speed. However, SSD(solid state disks), which has recently been used for various purposes, is more vulnerable to read performance than write performance. In this paper, we find out why read performance is slower than write performance in SSD composed of NAND flash memory and study buffer management policies to improve it. The buffer management policy proposed in this paper proposes a method of improving the speed of a flash-based storage device by analyzing the pattern of read data and applying a policy of pre-reading data to be requested in the future from NAND flash memory. It also proves the effectiveness of the read-ahead policy through simulation.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.28-33
• /
• 2006

The initial research of Task Computing in the ubiquitous computing (UbiComp) environment revealed the need for access control of services. Context-awareness of service requests in ubiquitous computing necessitates a well-designed model to enable effective and adaptive invocation. However, nowadays little work is being undertaken on service access control under the UbiComp environment, which makes the exposed service suffer from the problem of ill-use. One of the research focuses is how to handle the access to the resources over the network. Policy-Based Access Control is an access control method. It adopts a security policy to evaluate requests for resources but has a light-weight combination of the resources. Motivated by the problem above, we propose a universal model and an algorithm to enhance service access control in UbiComp. We detail the architecture of the model and present the access control implementation.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.246-254
• /
• 1997

This paper proposes an improved scheduling model and algorithm which threads in the fixed-priority policy have faster response time and turnaround time than existing ones in SRT system. Sub run queue is added into the system and is used for the quick execution and aging of threads in the fixed-priority policy. Using simulation two method are compared. The results shows that the new scheduling model gets threads in the fixed-priority policy to run faster than existing ones.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.1
• /
• pp.59-73
• /
• 1997

This papaer analyzes a system with consists of two workstations that are separated by finite buffer storage. In this system, we assume that the processing time in each station in a random variable and each station is not vulnerable to failure. To control the in-process inventory in the serial production system we use the (R, r) policy which is similar to the (s, S) policy in the inventory theory. Under the (R, r) policy the preceding station is forced down when the inventory level in the buffer reaches R and starts operation again when the inventory level falls to r. For the model developed, we analyze the system characteristics and the system performances.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.656-665
• /
• 2000

A critical issue in the performance of a video-on-demand system is the I/O bandwidth required in order to satisfy client requests. Several approaches: batching, bridging, piggybacking are used ot reduce the I/O demand on the video server through sharing. Piggybacking is the policy for altering display rates of requests in progress fro the same object, for the purpose of merging their corresponding I/O streams into a single stream, which can serve the entire group of merged requests. In this paper, we propose a new policy called an adaptive reservation-based piggybacking that dynamically reserves the I/O stream capacity of video server for popular videos according to video server loads to immediately schedule the requests for popular videos. The performance of the proposed policy is evaluated through simulations, and is compared with that of simple piggybacking. As the result, we know that the adaptive reservation-based piggybacking provides better service probability, average waiting time and percentages saving in frames than simple piggybacking.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1131-1134
• /
• 2002

정보 인프라의 고도화와 인터넷 사용의 폭발적인 증가로 인해 다양한 형태의 정보를 대량으로 교환할 수 있는 환경이 마련되었으며, 정보기술의 보편화를 통해 누구든지 쉽게 기술을 습득하고 이용하게 되었다. 인터넷 사용자는 크게 일반 사용자 및 적대적 사용자로 분류될 수 있으며, 특히 적대적 사용자는 정보의 불법적인 유출, 악용, 파괴할 수 있는 고도의 기술을 지닌 그룹으로서 인터넷의 존재 자체를 위협할 수 있는 수준이며, 이들의 기술은 날로 지능화되고 자동화되는 추세이다. 정보의 가치가 중요해 지면서 고급 정보에 대한 피해 사례가 늘어가고 있으나, 이를 정확하게 발견하고 신속하게 대처하기 위한 기술의 개발은 아직 초보 단계에 머무르고 있다. 본 논문에서는 실시간 탐지 및 효과적인 대응을 지원하기 위한 '정책(policy)' 기반의 저리 기법에 관해 설명한다.