• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.17 no.4
• /
• pp.29-41
• /
• 2014

The Korean government has purchased land properties alongside any significant water bodies before setting up the buffers to secure water qualities. Since the annual budgets are limited, however, there has always been the issue of which land parcels ought to be given the priority. Therefore, this study aims to develop efficient mechanism for land acquisition priorities in stream corridors that would ultimately be vegetated for riparian buffer zones. The criteria of land acquisition priority were driven through literary review along with experts' advice. The relative weights of their value and priorities for each criterion were computed using the Analytical Hierarchy Process(AHP) method. Major findings of the study are as follows: 1. The decision-making structural model for land acquisition priority focuses mainly on the reduction of non-point source pollutants(NSPs). This fact is highly associated with natural and physical conditions and land use types of surrounding areas. The criteria were classified into two categories-NSPs runoff areas and potential NSPs runoff areas. 2. Land acquisition priority weights derived for NSPs runoff areas and potential NSPs runoff areas were 0.862 and 0.138, respectively. This implicates that much higher priority should be given to the land parcels with NSPs runoff areas. 3. Weights and priorities of sub-criteria suggested from this study include: proximity to the streams(0.460), land cover(0.189), soil permeability(0.117), topographical slope(0.096), proximity to the roads(0.058), land-use types(0.036), visibility to the streams(0.032), and the land price(0.012). This order of importance suggests, as one can expect, that it is better to purchase land parcels that are adjacent to the streams. 4. A standard scoring system including the criteria and weights for land acquisition priority was developed which would likely to allow expedited decision making and easy quantification for priority evaluation due to the utilization of measurable spatial data. Further studies focusing on both point and non-point pollutants and GIS-based spatial analysis and mapping of land acquisition priority are needed.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.69-76
• /
• 2012

This paper proposes an efficient power consumption scheme using sleep mode in home gateway. The scheme by this paper classifies incoming real time packet and non-real time packet in home gateway and delay non-real time packet. Therefore, the home gateway can have longer sleep time because non-real time packet can get additional delay time by proposing mechanism using timer. We use non-preemptive two priority queueing model for performance analysis. As a results, we verify that power consumption of proposed scheme is reduced more than existing scheme by delay of non-real time traffic.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.270-280
• /
• 2007

In Linux, real-time tasks are supported by separating real-time task priorities from non-real-time task priorities. However, this separation of priority ranges may not be effective when real-time tasks make the system calls that are taken care of by the kernel threads. Thus, Linux is considered a soft real-time system. Moreover, kernel threads are configured to have static priorities for throughputs. The static assignment of priorities to kernel threads causes trouble for real-time tasks when real-time tasks require kernel threads to be invoked to handle the system calls because kernel threads do not discriminate between real-time and non-real-time tasks. We present a dynamic kernel thread scheduling mechanism with weighted average priority inheritance protocol (PIP), a variation of the PIP. The scheduling algorithm assigns proper priorities to kernel threads at runtime by monitoring the activities of user-level real-time tasks. Experimental results show that the algorithms can greatly improve the unexpected execution latency of real-time tasks.

• Journal of Digital Convergence
• /
• v.14 no.10
• /
• pp.303-310
• /
• 2016

Due to the ossification of the Internet, it is difficult to accommodate variety services. One of the efficient solution to this problem is network virtualization. It allows multiple parallel virtual networks to run on the shared physical infrastructure. It needs new resource allocation mechanism to share efficient physical resources. In this paper, we present efficient bandwidth allocation algorithm for virtual network request with high service priority. Our proposed algorithm can withdraw allocated bandwidth from low-level priority virtual network and maintain low-level virtual network service. We evaluated the performance of our proposed algorithm using simulation and found the improvement of approximately 8% acceptance rate.

• Journal of the military operations research society of Korea
• /
• v.2 no.1
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.526-534
• /
• 2014

Most of the multiplayer games available online are based on a client-server architecture because this architecture gives better administration control to the game providers than peer-to-peer architecture. In this architecture, the server is responsible for all the communication between the connected clients. The weakness of this architecture is its bandwidth requirement and scalability. Peer-to-peer architectures have then been proposed to solve these issues. In this paper, we propose a hybrid client-server architecture in which the game state is partially shared by the mobile terminal to achieve consistency among different players. Like a peer-to-peer architecture, this architecture uses client-side capacities to reduce bandwidth requirements for the server and improves consistency in wireless networks. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In the proposed architecture, either the server or the client applies consistency mechanism according to the priority level. Simulation experiments show that the bandwidth of the server in this architecture is smaller than that of the client-server architecture. As a result, the server in the proposed architecture can accommodate more clients with enhancing the scalability.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.3
• /
• pp.234-240
• /
• 1999

This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.58-68
• /
• 2013

Five-phase reservation protocol (FPRP) is a contention-based media access control protocol for wireless ad hoc networks. FPRP uses a five-phase reservation process to establish slot assignments based on time division multiple access. It allows a node to reserve only one slot in an information frame. Once a node has reserved a slot, it will cease contending for other slots. As a result, there may be less contending nodes in the remaining slots, so the time slots in an information frame are not fully used by FPRP. To improve time slot utilization, this paper proposes an improved pseudo-Bayesian algorithm, based on which an improved contention access mechanism for FPRP is proposed, in which nodes are allowed to contend for more than one slot in a reservation frame according to a certain probability/priority. Simulation results indicate that the proposed mechanism performs better than FPRP in time slot utilization and hence the network throughput under various scenarios.

• The Journal of Korea Robotics Society
• /
• v.5 no.1
• /
• pp.14-22
• /
• 2010

Recently researches on the window cleaning robot are being conducted actively. Moving mechanismsof these window cleaning robots are divided into two categories, which are towed type and walking type. Towed type is focused on fast cleaning on the flat surface of building and walking type has priority on cleaning task on relatively complex surface with overcoming obstacles. Currently commercialized towed type window cleaning robot has weakness that it is hard to adhere closely with the wall and easy to be affected by wind. In case of walking type it has the problem that the position errors are continuously accumulated during motion. In this paper, we propose new towed and walking type mechanism which can compensate previous weaknesses. After that we estimate the performance of each proposed mechanism by simulation.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.287-296
• /
• 2008

The IEEE 802.11 wireless standard uses the carrier sense multiple access with collision avoidance (CSMA/CA) as its MAC protocol (during the distributed coordination function period). This protocol is an adaptation of the CSMA/CD of the wired networks. CSMA/CA mechanism cannot guarantee quality of service (QoS) required by the application because orits random access method. In this study, we propose a new MAC protocol that considers different types of traffic (e.g., voice and data) and for each traffic type different priority levels are assigned. To improve the QoS of IEEE 802.11 MAC protocols over a multi-channel CSMA/CA, we have developed a new admission policy for both voice and data traffics. This protocol can be performed in direct sequence spread spectrum (DSSS) or frequency hopping spread spectrum (FHSS). For voice traffic we reserve a channel, while for data traffic the access is random using a CSMA/CA mechanism, and in this case a selective reject and push-out mechanism is added to meet the quality of service required by data traffic. To study the performance of the proposed protocol and to show the benefits of our design, a mathematical model is built based on Markov chains. The system could be represented by a Markov chain which is difficult to solve as the state-space is too large. This is due to the resource management and user mobility. Thus, we propose to build an aggregated Markov chain with a smaller state-space that allows performance measures to be computed easily. We have used stochastic comparisons of Markov chains to prove that the proposed access protocol (with selective reject and push-out mechanisms) gives less loss rates of high priority connections (data and voices) than the traditional one (without admission policy and selective reject and push-out mechanisms). We give numerical results to confirm mathematical proofs.