• Proceedings of the Korean Society of Agricultural Engineers Conference
• /
• 2003.10a
• /
• pp.99-102
• /
• 2003

The purpose of this study is the making of standard which is optimal region selection for the creation of the naturally favorable waterfront area. We surveyed data of twenty two site in Korea where are managed KARICO(Korea Rural Infrastructure Corporation). Three different evaluation methods, simple score give method, subjective evaluation method, and check-list method were used. We were divided into "the highest priority area in consolidation rank", "the priority area in consolidation rank", the other area in consolidation rank". Thus, the object areas for consolidation of environment friendly canals will be chosen as in an objective manner and they will be good use of the long-term plan for consolidation of environment friendly canals.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2014.05a
• /
• pp.174-175
• /
• 2014

A Rural house in Chungcheong area have been variety of matters, rapid deterioration of house and incomplete of maintenance control, that is represented lack of durability heating from lack of heat insulation property, health worsening form use of toxic substance and so on. For farmers who did not know where to repair and how to repair, they are urgently needed measures of standard and basis that is to realize a condition of rural house. Accordingly, this study drew major matters and priority for revitalization through analysis of type of rural house from research on the actual condition in order to develope of diagnostic criteria of rural house.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.747-748
• /
• 2008

In this paper, we propose a new algorithm for task scheduling consisting of subtask partitioning and subtask priority scheduling steps in order to keep the peak power under the system specification. The subtask partitioning stepis performed to minimize the idle operation time for processors by dividing a task into multiple subtasks using the least square method developed with power consumption pattern of tasks. In the subtask priority scheduling step, a priority is assigned to a subtask based on the power requirement and the power variation of subtask so that the peak power violation can be minimized and the task can be completed within the execution time deadline.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.2
• /
• pp.196-204
• /
• 1996

This paper presents a new scheduling algorithm, which is the most improtant subtask in the high level synthesis. The proposed algorithm performs scheduling in consideration of resource sharing concept based on characteristics of conditionsla bransches in the intermediate data structure. CDFG (control data flow graph) generated by a VHDL analyzer. This algorithm constructs a conditon graph based on time frame of each operation using both the ASAP and the ALAP scheduling algorithm. The conditon priority is obtained from the condition graph constructed from each conditional brance. The determined condition priority implies the sequential order of transforming the CDFG with conditonal branches into the CDFG without conditional branches. To minimize resource cost, the CDFG with conditional branches are transformed into the CDFG without conditonal brancehs according to the condition priority. Considering the data dependency, the hardware constraints, and the data execution time constraints, each operation in the transformed CDFG is assigned ot control steps. Such assigning of unscheduled operations into contorl steps implies the performance of the scheduling in the consecutive movement of operations. The effectiveness of this algorithm is hsown by the experiment for the benchmark circuits.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.2
• /
• pp.9-17
• /
• 1994

This paper proposes Double queue threshold QLT(Queue Length Threshold) algorithm and Hysteresis effect QLT algorithm. as being DPS(Dynamic Priority Scheduling) techniques. in order to advance the processing of multiple class traffics. Also, the performance of the proposed algorithms is analyzed through computer simulations,and the priority scheduling is analyzed using a retrial queue with two types of calls. Our simulation results show that the performance of the proposed Double queue length threshold QLT algorithm is superior to that of the conventinal QLT algorithm for 2 or more classes delay sensitive traffics. Also we find that Hysteresis effecT QLT algorithm is better mechanism than that of the existing QLT for real time and non-real time traffics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1876-1889
• /
• 2013

Packet-based mobile multimedia services for the Internet differ with respect to their resource requirements, performance objectives, and resource usage efficiencies. Nonetheless, each mobile terminal should support a variety of multimedia services, sometimes even simultaneously. This paper proposes a sub-channel allocation scheme based on multi-level priority for supporting mobile multimedia services in an Orthogonal Frequency Division Multiple Access (OFDMA) system. We attempt to optimize the system for satisfying the Quality of Service (QoS) requirements of users and maximize the capacity of the system at the same time. In order to achieve this goal, the proposed scheme considers the Signal-to-Interference-plus-Noise Ratio (SINR) of co-sub-channels in adjacent cells, the Signal-to-Noise Ratio (SNR) grade of each sub-channel in the local cell on a per-user basis, and the characteristics of the individual services before allocating sub-channels. We used a simulation to evaluate our scheme with the performance measure of the outage probabilities, delays, and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1470-1479
• /
• 1996

It was already proved that ATM has stability and flexibility of service applications, but because of the various characteristics of traffic and the QoS on user demandcaused by them, there are so many researches for traffic control method. In this paper, in order to give the more similar properties of the real traffic to the existing input traffic source, dividing them into four classes with different characteristics, and We proposed the integrated dynamic priority method, IDP which has advantages of the DMLT and the DQLT for time dynamic priority. Thus, it makes input queues about each of traffic classes and thresholds, and then use modified DMLT and DQLT methods. It has goal that proposed method to get more reliability and stability with advantage low loss of the DMLT, low delay of DQLT.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.422-429
• /
• 2010

We present guaranteed dynamic priority assignment schemes for multiple real-time tasks subject to (m, k)-firm deadlines. The proposed schemes have two scheduling objectives: providing a bounded probability of missing (m, k)-firm constraints and maximizing the probability of deadline satisfactions. The second scheduling objective is especially necessary in order to provide the best quality of service as well as to satisfy the minimum requirements expressed by (m, k)-firm deadlines. We analytically establish that the proposed schemes provide a guarantee on the bounded probability of missing (m, k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed schemes with regard to their scheduling objectives.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.267-288
• /
• 1995

We investigate a multiclass priority system with a mixed service discipline, and propose a new approach to the analysis of performance measures (mean waiting times) of the system. Customers are preferentially served in the order of priority. The service discipline at each station is either gated or exhaustive discipline. We formulate mean waiting times as functions on the state of the system. We first consider the system at an arbitrary system state to obtain explicit formulae for the mean waiting times, and then derive their steady state values by using the property of Poisson arrivals to see time averages and the generalized Little's formula.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.11
• /
• pp.476-484
• /
• 2006

The failure prediction and preventive maintenance for the equipment of nuclear power plant area using reliability-centered maintenance have been grown. On the other hand, the maintenance for power distribution system consists of time-based maintenance mainly. In this paper, the new maintenance algorithms for power distribution system are developed considering reliability indices. First of all, Time-varying failure rates are extracted from data accumulated at KEPCO using exponential distribution function and weibull distribution function. Next, based on the extracted failure rate, reliability for real power distribution system is evaluated for applying the effective maintenance algorithm which is the analytic method deciding the maintenance point of time and searching the feeder affecting the specific customer. Also the algorithm deciding the maintenance priority order are presented based on sensitivity analysis and equipment investment plan are analyzed through the presented algorithm at real power distribution system.