• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2235-2246
• /
• 1997

This paper presents an effective heuristic task scheduling algorithm for multiprocessor systems. To execute task scheduling effectively which is defined as an allocation of m's tasks onto n's processors(m > n), several problems almost at NP-hard should be cleaned up. The purpose of the task scheduling obtains the minimum execution time by mapping the tasks on a system topology or reduces the total execution time to give a minimum system topology. In order to solve this problem, in this paper, the task scheduling is done by redefining a task graph to a reconstructed task graph (RTG). An RTG is obtained by merging or copying nodes to equal the number of nodes on each level of the task graph to the number of processors of the system topology and then directly scheduled to the system topology. This method obtains a fast scheduling time and a simple scheduling method, and near-optimal execution time without executing steps such as the refinement step and the duplication step after the task scheduling.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.29-36
• /
• 2016

A wireless passive sensor network is a network which, by letting separate RF sources supply energy to sensor nodes, is able to live an eternal life without batteries. Against expectations about an eternal life, however, a wireless passive sensor network still has many problems; scarcity of energy, non-simultaneity of energy reception and data transmission and inefficiency in resource allocation. In this paper, we focus on a wireless passive sensor network providing a packet service which is tolerable to packet losses but requires timely delivery of packets. Perceiving the practical constraints, we then consider a contending-type MAC scheme, rooted in framed and slotted ALOHA, for supporting many sensor nodes to deliver packets to a sink node. Next, we investigate the network-wide throughput achieved by the MAC scheme when the packets transmitted by geographically scattered sensor nodes experience path losses hence capture phenomena. Especially, we derive an exact formula of network-wide throughput in a closed form when 2 sensor nodes reside in the network. By controlling design parameters, we finally optimize the contending-type MAC scheme as to attain the maximum network-wide throughput.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.15 no.6
• /
• pp.29-34
• /
• 1978

It has been investigated that the elect of an wideband FDM-FM signal upon an M-ary coherent PSK (MCPSK) signal in an intersystem radio interference environment between analog and digital systems, which had not been discussed before and had been obscure. It is assumed that PSK and FM signal are adjacently allocated in same radio frequency band. And the symbol error performance of MCPSK signal with co-channel and adjacent channel interference from an FDM-FM signal is evaluated with considering the receiver noise. The numerical results for the theoretical symbol error rates of MCPSK system in the presence of Gaussian noise and co-channel or adjacent channel interference are given in graphical forms as the function of carrier-to-noise ratio (CNR), carrier-to-interference ratio (CIR) and normalized carrier separation between the desired PSK and interfering FM signal. The objective of this research is to find some optimal conditions for coexistence of analog and digital systems in an intersystem interference environment. The results we obtained here stress a possible utilization of them for designing the frequency allocation, bandwidth and power of PSK channel in the intersystem interference from an FDM-FM signall.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1463-1479
• /
• 2013

In this paper, we propose an unequal protection physical coding sub-layer (PCS) forward error correction (FEC) scheme for efficient and high-quality transmission of video data over optical access networks. Through identifying and resolving the unequal importance of different video frames and passing this importance information from MAC-layer to PCS, FEC scheme of PCS can be adaptive to application-layer data. Meanwhile, we jointly consider the different channel situations of optical network unit (ONU) and improve the efficiency of FEC redundancy by channel adaptation. We develop a theoretical algorithm and a hardware method to achieve efficient FEC assignment for the proposed unequal protection scheme. The theoretical FEC assignment algorithm is to obtain the optimal FEC redundancy allocation vector that results in the optimum performance index, namely frame error rate, based on the identified differential importance and channel situations. The hardware method aims at providing a realistic technical path with negligible hardware cost increment compared with the traditional FEC scheme. From the simulation results, the proposed Channel and Application-layer data Adaptation Unequal Protection (CAAUP) FEC scheme along with the FEC ratio assignment algorithm and the hardware method illustrates the ability of efficient and high-quality transmission of video data against the random errors in the channel of optical access networks.

• Communications for Statistical Applications and Methods
• /
• v.18 no.4
• /
• pp.423-431
• /
• 2011

For procuring more sensitive information and estimating stratum target population proportion as well as an overall one form a sensitive population composed of several strata we suggest a two-stage stratified unrelated question model that uses stratified random sampling instead of simple random sampling in the two-stage unrelated question model by Kim et al. (1992) and extend it to the three-stage stratified unrelated question model. We also deal with the proportional and optimal allocation problems in each suggested model, compare the relative efficiency of the suggested two models, and show that the three-stage stratified unrelated question model is more efficient than the two-stage one in view of the variance.

• Journal of Korean Society of Transportation
• /
• v.29 no.6
• /
• pp.129-136
• /
• 2011

Variable Message Signs have been used for providing information on the current traffic conditions. However, it is considered more important to achieve optimal traffic allocation among the alternative routes by strategic VMS information provision. Fuzzy control is very effective and efficient to deal with such systems that are too complex and uncertain to build mathematical models. In this paper, a fuzzy feedback controller for VMS is proposed, whose goal is to achieve the travel time equilibrium between the two alternative routes. The performance of the suggested controller is implemented and examined using MATLAB/Simulink. More robust controller applicable to a real highway network is suggested for the further research.

• Journal of the Korean Society of Systems Engineering
• /
• v.13 no.1
• /
• pp.79-88
• /
• 2017

For the PBL contract, it is necessary for the contracting parties to share information regarding the reasonable inventory-level and the cost of its repair parts for the estimated demand. There are various models which can be used for this purpose. Among them, V-METRIC model is considered to be the most efficient and is most frequently applied. However, this model is usually used for optimizing the inventory level of the repair parts of the system under operation. The model uses a time series forecast model to determine the demand rate, which is a mandatory input factor for the model, based on past field data. However, since the system at the deployment stage has no operational performance record, it is necessary to find another alternative to be used as the demand rate of the model application. This research applies the V-METRIC model to find the optimal inventory level and cost estimation for repairable items to meet the target operational availability, which is a key performance indicator, at the time of the PBL contract for the deployment system. This study uses the calculated value based on the allocated MTBF to the system as the demand rate, which is used as input data for the model. Also, we would like to examine changes in inventory level and cost according to the changes in target operational availability and MTBF allocation.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.1950-1957
• /
• 2015

Modern wind generators (WGs) are forced or encouraged to participate in frequency control in the form of inertial and/or primary control to improve the frequency stability of power systems. To participate in primary control, WGs should perform deloaded operation that maintains reserve power using speed and/or pitch-angle control. This paper proposes an optimization formulation that allocates the required reserve to WGs to maximize the kinetic energy (KE) stored in a wind power plant (WPP). The proposed optimization formulation considers the rotor speed margin of each WG to the maximum speed limit, which is different from each other because of the wake effects in a WPP. As a result, the proposed formulation allows a WG with a lower rotor speed to retain more KE in the WPP. The performance of the proposed formulation was investigated in a 100-MW WPP consisting of 20 units of 5-MW permanent magnet synchronous generators using an EMTP-RV simulator. The results show that the proposed formulation retains the maximum amount of KE with the same reserve and successfully increases the frequency nadir in a power system by releasing the stored KE in a WPP in the case of a disturbance.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1433-1442
• /
• 1997

Algorithm design is needed to optimized bandwidth which satisfy quality of service(QoS) requirements of vary traffic classes for Multimedia service in ATM networks. The diverse flow characteristics e.g., burstiness, bit rate and burst length, have to guarantee the different quality of service(QoS) requirements in Asynchronous Transfer Mode(ATM). The QoS parameter may be measured in terms of cell loss probability and maximum cell dely. In this paper, we consider the ATM networks which the virtual path(vip) concept is implemented by applying the Markov Modulated Deterministic Process method. We develop an efficient algorithm to computer the minimum capacity required to satisfy all the QoS requirements when multiple classes of on-off source are multiplexed on single VP. Using above the result, we propose a simple algorithm to determine the VP combination to achieve the near optimum of total capacity required for satisfying the individual QoS requirements. Numerical results are also presented to demonstrate the performance of the algorithm, when compared to the optimal total capacity required.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.115-122
• /
• 2011

It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.