• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.9
• /
• pp.758-767
• /
• 2000

The properties of linear time-varying(LTV) systems vary because of the time-varying property of plant parameters. The generalized controller design method for linear time-varying systems does not exit because the analytic soultion of dynamic equation has not been found yet. Hence, to design a controller for LTV systems, the robust control methods for uncertain LTI systems which are the approximation of LTV systems have been generally ised omstead. However, these methods are not sufficient to reflect the fast dynamics of the original time-varying systems such as missiles and supersonic aircraft. In general, both the performance and the robustness of the control system which is designed with these are not satisfactory. In addition, since a better model will give the more robustness to the controlled system, a gain scheduling technique based on LTI controller design methods has been uesd to solve time problem. Therefore, we propose a new gain scheduled QFT method for LTV systems based on neural networks in this paper. The gain scheduled QFT involves gain dcheduling procedured which are the first trial for QFT and are well suited consideration of the properties of the existing QFT method. The proposed method is illustrated by a numerical example.

• KIISE Transactions on Computing Practices
• /
• v.23 no.9
• /
• pp.572-577
• /
• 2017

Virtualization allows multiple virtual machines to share the resources of a physical machine in order to utilize idle resources. The purpose of virtualization is the efficient allocation of resources among virtual machines. However, the efficient allocation of resources is difficult because the workload characteristics of each virtual machine cannot be understood in the current virtualization environment. This causes performance interference among virtual machines, which leads to performance degradation of the virtual machine. Previous works have been carried out to develop a method of solving such performance interference. This paper introduces a representative method, a CPU scheduling method that guarantees I/O performance by using feedback control to solve performance interference. In addition, we compare and analyze a model-based feedback control method and a dynamic feedback control method.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• 2007.11a
• /
• pp.327-330
• /
• 2007

This paper verifies that the normality assumption that the simulation output data, Project Completion Times (PCTs), follow normal distribution is not always acceptable and the existing belief may lead to misleading results. A risk quantification method, which measures the effect caused by the assumption, relative to the probability distribution of PCTs is implemented as an algorithm in MATLAB. To validate the reliability of the quantification, several series of simulation experiments have been carried out to analyze a set of simulation output data which are obtained from different type of Probability Distribution Function (PDF) assigned to activities'duration in a network. The method facilitates to find the effect of PDF type and its parameters. The procedure necessary for performing the risk quantification method is described in detail along with the findings. This paper contributes to improving the reliability of simulation based scheduling method, as well as increasing the accuracy of analysis results.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.128-131
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assigns the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. In result, the proposed algorithm enhances the packet discard rate at the EF class than WRR scheduling method and the AF4 class than PQ scheduling method.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.14 no.3
• /
• pp.59-67
• /
• 2000

This paper describes the unified reliability evaluation with partial loss of continuity for Inchon international airport distribution system which is complex and difficult system to implement. To evaluate reliability considering line limitation and voltage drop of the system, PLOC technique which is based on deterministic evaluation technique and failure mode & effective analysis method is employed. And reliability indices calculation method is used. Finally, to evaluate the system performance and to improve the reliability of the system, Analytic network process method is employed. As a result, calculating accurate reliability, finding weak points, and expansion scheduling of the system is possible.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.188-200
• /
• 2002

The WRR scheduling algorithm is widely used in ATM networks due to its simplicity and the low cost of hardware implementation. It guarantees minimum cell rate according to the weight of each queue. The fairness is a important factor for ABR service. That is, scheduling algorithm allocates network resources fairly to each VC. However, WRR algorithm shows worse performance on bursty traffic. Because it schedules input traffics according to predetermined weight, it can not satisfies fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, defined by ATM Forum TM 4.1 specification. The Nabeshima et al algorithm is not adapt to network status rapidly because it is not compensate the weights of unused bandwidth to VCs and assign the unused bandwidth to VCs by RR method. In this paper, we propose a scheduling algorithm for satisfying the two fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, among the six criteria defined by ATM Forum TM 4.1 specification. The WRR, Nabeshima et al, and the proposed scheduling algorithms are compared with respect to fairness and convergence time throughout experimental simulation. According to the simulation results, the proposed algorithm shows higher fairness and more rapid convergence than other algorithms.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.4
• /
• pp.323-333
• /
• 2001

This paper presents a decision making model for the cruise ship management. A network based optimization model has been developed for a single cruise ship operation. It gives optimal itinerary patterns over the planning period for the cruise ship managers wanting to maximize profit from the cruise ship operation. A network solution method to find the optimal solution is also developed. This network model can be equivalently transformed into a linear programming model, which makes the implementation of the model quite practical however complicated the given set of possible itineraries may be. The ship scheduling network developed in this study can also be used as a general framework to describe all possible cruise ship itineraries the cruise ship manager can figure out.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.25-29
• /
• 2001

There are so many researches about the search method for the most compatible dispatching rule to a manufacturing system state. Most of researches select the dispatching rule using simulation results. This paper touches upon two research topics: the clustering method for manufacturing system states using simulation, and the search method for the most compatible dispatching rule to a manufacturing system state. The manufacturing system state variables are given to ART II neural network as input. The ART II neural network is trained to cluster the system state. After being trained, the ART II neural network classifies any system state as one state of some clustered states. The simulation results using clustered system state information and those of various dispatching rules are compared and the most compatible dispatching rule to the system state is defined. Finally there are made two knowledge bases. The simulation experiments are given to compare the proposed methods with other scheduling methods. The result shows the superiority of the proposed knowledge base.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.2
• /
• pp.154-158
• /
• 2008

Autonomous business card exchange system using ZigBee with low power and short range was configured In the autonomous business card exchange system characterized as full mesh network in which every node exchanges each information one by one, it is necessary to reduce the time taken for information to be exchanged. In this paper, the novel method where the node ID is exchanged based on CSMA/CA and then the information of each node is broadcast to other nodes according to the ID list based on FIFO. The time required for exchanging information using the proposed method was analyzed and compared with the direct exchange method based on CSMA/CA. The results show that it takes less time in the proposed method than the direct exchange time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.49-56
• /
• 2004

Load imbalance is a serious impediment to achieving good performance in parallel processing. Global load balancing schemes cannot adequately manage to balance parallel tasks generated from a single application. Dynamic loop scheduling methods are known to be useful in balancing parallel loops on shared-memory multiprocessor machines. However, their centralized nature causes a bottleneck for the relatively small number of processors in a network of workstations because of order-of-magniture differences in communication overheads. Moreover, improvements of basis loops scheduling methods have not effectively dealt with irregularly distributed workloads in parallel loops, which commonly occur in applications for a network of workstation. In this paper, we present a new reconfigurable and decentralized balancing method for parallel loops on a network of workstations. Since our method supplements performance balancing with those tranditional load balancing methods, it minimizes the overall execution time.