• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.375-381
• /
• 2012

If a mobile station requests a channel allocation in its mobile networks, the switching center assigns a channel to a mobile station that belongs to each base station. There are three kinds of channel allocation schemes; a fixed channel allocation, a dynamic channel allocation and a hybrid combination of these two forms. In assigning a good frequency, it is our intention to provide quality service to our customers as well as to use resources efficiently. This paper proposes methods of assigning frequencies that minimize interference between channels and that also minimize the amount of searching time involved. In this paper, we propose an algorithm to per specific equipment, regardless of the number of channels that can be used as a general-purpose system, such as base stations, control stations, central office model is proposed, the existing operators manner similar to the fixed channel allocation based statistics and assigned when the conventional method and the improved method is proposed. Different ways and compared via simulations to verify the effectiveness of the proposed approach.

• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.413-420
• /
• 2010

In this paper, we propose a scheme for dynamic allocating network bandwidth based on the playback buffer levels of the clients in a distributed mobile multimedia system. In this scheme, the amount of bandwidth allocated to serve a video request depends on the buffer level of the requesting client. If the buffer level of a client is low or high temporarily, more or less bandwidth will be allocated to serve it with an objective to make it more adaptive to the playback situation of this client. By employing the playback buffer level based bandwidth allocation policy, fair services can also be provided to the clients. In order to support high quality video playbacks, video frames must be transported to the client prior to their playback times. The main objectives in this bandwidth allocation scheme are to enhance the quality of service and performance of individual video playback such as to minimize the number of dropped video frames and at the same time to provide fair services to all the concurrent video requests. The performance of the proposed scheme is compared with that of other static bandwidth allocation scheme through extensive simulation experiments, resulting in the 4-9% lower ratio of frames dropped according to the buffer level.

• Journal of Environmental Policy
• /
• v.5 no.1
• /
• pp.1-23
• /
• 2006

This study explores what potential future greenhouse gas allocation schemes might mean for OECD countries, and discusses a number of concepts of equity, examines three specific burden sharing rules and formulae. The results indicate that Korea reduces its emission from 8.1% and 19.8% which is 34.9-85.8 million tons of $CO_2$ emission on the assumption that the overall level of abatement remains 20% of total 2000 OECD emissions.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2204-2218
• /
• 2000

This paper proposes a dynamic storage allocation algorithm, QHF(quick-half-fit) for real-time systems. The proposed algorithm manages a free block list per each worked size for memory requests of small size, and a free block list per each power of 2 size for memory requests of large size. This algorithms uses the exact-fit policy for small sie requests and provides high memory utilization. The proposed algorithm also has the time complexity O(I) and enables us to easily estimate the worst case execution time (WCET). In order to confirm efficiency of the proposed algorithm, we compare he memory utilization of proposed algorithm with that of half-fit and binary buddy system that have also time complexity O(I). The simulation result shows that the proposed algorithm guarantees the constant WCET regardless of the system memory size and provides lower fragmentation ratio and allocation failure ratio thant other two algorithms.

• Journal of Climate Change Research
• /
• v.7 no.3
• /
• pp.289-297
• /
• 2016

In this study, we researched the emission source category and it was calculated emissions estimates from existing research or literature review related to port. In addition, we have created the basis for a policy that can reduce greenhouse gas emissions calculation based on the results of the harbor. Greenhouse gas emissions estimation results, we proposed a method for allocating the GIS space. In this study, we confirmed based on the calculated greenhouse gas emissions by sources resulting in the GIS Map Port result of the expression construct for space allocation. Based on these results, it tries to provide the basic data that can be used when you want to create a local government measures to reduce scenario in the future.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.8
• /
• pp.81-88
• /
• 2009

Many studies and policies are suggested for customer satisfaction to survive in multimedia content service markets. there are policies like a segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM. The problem of this policy is fixed allocation of media server resources. It is inefficient for costly media server resource. To resolve the problem and enhance the utilization of media server resource, the ACRFA (Adaptive Client Request Filtering Algorithm) was suggested per cluster to allocate media server resources by flexible resource allocation method.

• Journal of Korean Society of Rural Planning
• /
• v.14 no.2
• /
• pp.13-23
• /
• 2008

In this paper, we estimated the economic impacts of Korea-EU FTA on the agricultural sector in GyeongGi-Do. In particular, we estimated the economic impacts of agricultural production decrease resulting from Korea-EU FTA for 31 sub-regions in GyeongGi-Do by 15 industrial sectors. We employ a regional economic impact model combining a regional input-output model with a spatial allocation model. We found that the size of inter-industrial impacts are quite different across regions. Our results suggest the importance of agricultural and industrial policy considering the impacts of industrial sectors at the regional level.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.53-68
• /
• 1996

This paper focuses on the method of setting priorities for telecommunications standardization work areas (SWAs) and standardization work items (SWIs), detailed sub-areas of each SWA. It is based on prioritization of SWAs to make a strategic plan that usually includes prioritization, resource allocation and standardization schedules for each SWA in telecommunications field. We applied the simple Delphi technique and the Analytic Hierarchy Process (AHP) to the prioritization process. We also introduce 0-1 integer programming for resource allocation using the AHP result. We present analyzed results according to the proposed process. The result of this study will be useful input for telecommunications standardization policy making and practical implementation.

• Proceedings of the Korea Technology Innovation Society Conference
• /
• 2003.05a
• /
• pp.105-120
• /
• 2003

Academic Capitalism is one of main steams that university has made. Academic Capitalism means that the resource allocation in the university is made by market forces. Persons who advocate the traditional Ivory Tower will resist the market mechanism in university's resource allocation. But, in several aspect, market mechanism has been in action in the university, whether we recognized it or not. In this paper, five directions of Academic System Innovation were suggested. First, competition among universities should be enforced through decentralization and autonomy. Second, competition among researchers shoul be enforced. Third, government should enlarge the portion of 'use-inspired basic research'. Fourth, autonomy of research units in a university should be enlarged for university's competitiveness. Five, government should provide the environment for structural coupling between university and regional society.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.9
• /
• pp.727-735
• /
• 2003

The determination of completion time constitutes an important step in developing algorithms for short-term production scheduling. Existing completion time algorithms of multi-product batch processes often assume that intermediate storage tanks are always available when it is needed. In this paper, we consider a serial multi-product batch plants with ZW and NIS policy intermediate storge tank. We limit storage residence time and allocated products in the intermediate storage tank to minimize the quality change of the stored material as well as to reduce the clearing time during product change. A set of recurrence relations is suggested to calculate the completion times for the given batch sequence of products on all processing units. Also analytic solution for the suggested model is solved by a graphical method. The effectiveness of these results is proved by a few illustrative examples.