• Title/Summary/Keyword: Dynamic optimal allocation

Search Result 76, Processing Time 0.03 seconds

A study on power system stabilization using Variable Structure Stabilizer (가변구조 안정화 장치를 사용한 전력계통 안정화에 관한 연구)

  • Chung, Jai-Kil;Kim, Jung-Ha;Kang, Dong-Gu
    • Proceedings of the KIEE Conference
    • /
    • 1995.11a
    • /
    • pp.83-85
    • /
    • 1995
  • A technique for power system' stabilization is presented using the variable structure control theory. The selection problem of the proper switching vector is very important subject for a design of the variable structure controller. In this paper, the switching vector is selected by desired eigenvalues allocation. and these desired eigenvalues are determined by eigenvalue assignment. Simulation results show that eigenvalue allocation variable structure stabilizer yields better dynamic performance than the others (conventional PSS, optimal linear stabilizer) and is robust to wide variations of the system parameters.

  • PDF

Supply-Driven Strategies Model for Resource Management in Grid Environment (그리드 환경에서의 효율적인 자원 관리를 위한 공급-조정 전략 모델)

  • Ma Yong-Beom;Lee Jong-Sik;Cho Kyu-Cheol;Kim In-Hee;Jang Sung-Ho;Park Da-Hye
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2005.11a
    • /
    • pp.65-70
    • /
    • 2005
  • Recently, Grid is embossed as a new issue according to the need of cooperation related to distributed resources, data sharing, Interaction and so on. It focuses on sharing of large scale resources, high-performance, applications of new paradigms, which improved more than established distributed computing. Because of the environmental specificity distributed geographically and dynamic, the most important problem in grid environment is to share and to allocate distributed grid resources. This paper proposes supply-driven strategies model that is applicable for resource management in grid environment and presents a optimal resource allocation algorithm based on resource demands. Supply-driven strategies model can offer efficient resource management by transaction allocation based on user demand and provider strategy. This paper implements the supply-driven strategies model on the DEVS modeling and simulation environment and shows the efficiency and excellency of this model by comparing with established models.

  • PDF

The Workload Distribution Problems in a Class of Flexible Manufacturing Systems

  • Kim, Sung-Chul
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.15 no.1
    • /
    • pp.65-75
    • /
    • 1989
  • This study complements the previous studies on workload distribution problems in Flexible Manufacturing Systems. Specifically, we consider the problem in two perspectives, the long-range policy and the short and medium-term planning and control. The long-term loading policy focusses on identifying the optimal loading of the system characterized by either balanced loading or unique unbalanced loading for which a steepest ascent method is developed. These results are then applied to study the optimal medium and short-term planning and control problems, for which a truncated dynamic programming method is developed in order to obtain the optimal allocation of the given operation mix of part types to work stations.

  • PDF

A Novel Bit Allocation Method Using Two-phase Optimization Technique (2단계 최적화 방법을 이용한 비트할당 기법)

  • 김욱중;김성대
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.8
    • /
    • pp.2032-2041
    • /
    • 1998
  • In this work, we propose a novel bit allocation method that is to minimize overall distortions subject ot the bit rate constraint. We partition the original bitallocation problem into 'macroblock level bit allocation' problems that can be solved by conventional Lagrangian mutiplier methods and a 'frame level bit allocation' problem. To tackle the frame level problem, 'two-phase optimization' algorithm is used with iter-frame dependency model. While the existing approaches are almost impossible to find the macroblock-unit result for the moving picture coding system due to high computational complexity, the proposed algorithm can drastically reduce the computational loads by the problem partitioning and can obtain the result close to the optimal solution. Because the optimally allocated results can be used as a benchmark for bit allocation methods, the upper performance limit, or a basis for approximation method development, we expect that the proposed algorithm can be very useful for the bit allocation related works.

  • PDF

Optimal Water Allocation by Dynamic Programming (동적계획법에 의한 물 배분)

  • 이순탁;이진우
    • Water for future
    • /
    • v.18 no.2
    • /
    • pp.163-174
    • /
    • 1985
  • This study aims at the development of a technique for the optimal water allocation by applying Dynamic Programming Model for the effective usage and rational allocation of water resources, in case of which limited water resources in river basin should be used in several stages. In analytical procedure the possible allocable area was firstly zoned into the four areas: Pohang area ($C_1$), Yeungcheon area ($C_2$), Gyeungsan area ($C_3$), Daegu area ($C_4$), which are located between the Yeongcheon dam and the confluence of the lower Kumho river and the main course of the Nakdong river. Secondly, a return function was determined on the basis of the correlation between the GRP in each area and the amount of water used to it. A DP Model, finally, was applied to the allocation of the water resources according to both their usage and the areas. As a result, the fact has been found that when allocating by the area, $C_1$ could be possibly supplied only with the water resources avaiable from the Yeungchon dam, and the maximum units supplied to $C_1$ should be 240 units ($1unit=10^3㎥$ per day), beyond which we ought to develop an alternative water resources. Also, the return from the allocation by the usage exceeded the one from it by the area. At the same time it was more profitable to limit the water supply to $C_1$ into 217 units. In the allocation by the area 240 units and 80 units, if only the water resources available from the Yeungcheon dam used, and 360 units and 80 units if the Doil dam used additionally, could be supplied to $C_1$ and the lower region respectively. In the allocation by the usage 103 units for industrial water with 33 units for both domestic and commercial water and 183 units, if only the water resources available from the Yeungcheon dam used, and 103 units with 33 units and 304 units, if the Doil dam taken into consideration additionally, could be supplied to $C_1$ and the lower region respectively. Therefore, much more water could be allocated to the region of lower Kumho river if the method of water allocation by the usage.

  • PDF

OFEX Controller to Improve Queueing and User Performance in Multi-bottleneck Networks

  • Liu, Jungang;Yang, Oliver W.W.
    • ETRI Journal
    • /
    • v.36 no.3
    • /
    • pp.396-406
    • /
    • 2014
  • We have designed and investigated a new congestion control scheme, called optimal and fully explicit (OFEX) controller. Different from existing relatively explicit controllers, this new scheme can provide not only optimal bandwidth allocation but also a fully explicit congestion signal to sources. It uses the congestion signal from the most congested link instead of the cumulative signal from the flow path. In this way, it overcomes the drawback of relatively explicit controllers exhibiting bias toward multi-bottlenecked users and significantly improves their convergence speed and source throughput performance. Furthermore, our OFEX-controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based multi-access networks. Compared with former works/controllers, this remedy also effectively reduces the instantaneous queue size in a router and thus significantly improves queuing delay and packet loss performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison with the existing relatively explicit controllers verifies the superiority of our new scheme.

Bio-MAC: Optimal MAC Protocol for Various Bio-signal Transmission in the WBSN Environment (Bio-MAC: WBSN환경에서 다양한 생체신호 전송을 위한 최적화된 MAC Protocol)

  • Jang, Bong-Mun;Ro, Young-Sin;Yoo, Sun-Kook
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.423-425
    • /
    • 2007
  • In this paper, Medium Access Control(MAC) protocol designed for Wireless Body area Sensor Network(Bio-MAC) is proposed, Because in WBSN, the number of node is limited and each node has different characteristics. Also, reliability in transmitting vital data sensed at each node and periodic transmission should be considered so that general MAC protocol cannot satisfy such requirements of biomedical sensors in WBSN. Bio-MAC aims at optimal MAC protocol in WBSN. For this, Bio-MAC used Pattern -SuperFrame, which modified IEE E 802.15.4-based SuperFrame structurely. Bio-MAC based on TDMA uses Medium Access-priority and Pattern eXchange -Beacon method for dynamic slot allocation by considering critical sensing data or power consumption level of sensor no de etc. Also, because of the least delay time. Bio-MAC is suitable in the periodic transmission of vital signal data. The simulation results demonstrate that a efficient performance in WBSN can be achieved through the proposed Bio-MAC.

  • PDF

Performance Enhancement of An Optimal Network Protocol for High-Speed Communication (고속통신을 위한 최적 네트워크프로토콜의 성능 향상)

  • 강문식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.9
    • /
    • pp.1641-1647
    • /
    • 1994
  • This paper describes an optimal communication protocol for high-speed networks. This scheme can support multimedia services and provide fast data transmission using the distributed gueue scheme and the dynamic bandwidth allocation architecture, based on ATM(Asynchronous Transfer Mode). Performance analyses and simulation results are presented to illustrate the effectiveness of the proposed scheme in a variety of communication environments.

  • PDF

Dynamic Task Assignment Using A Quasi-Dual Graph Model (의사 쌍대 그래프 모델을 이용한 동적 태스크 할당 방법)

  • 김덕수;박용진
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.6
    • /
    • pp.62-68
    • /
    • 1983
  • We suggest a Quasi- dual graph model in consideration of dynamic module assignment and relocation to assign task optimally to two processors that have different processing abilities. An optimal module partitioning and allocation to minimize total processing cost can be achieved by applying shortest-path algorithm with time complexity 0(n2) on this graph model.

  • PDF

The Allocation of Inspection Efforts Using a Knowledge Based System

  • Kang, Kyong-sik;Stylianides, Christodoulos;La, Seung-houn
    • Journal of Korean Society for Quality Management
    • /
    • v.18 no.2
    • /
    • pp.18-24
    • /
    • 1990
  • The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

  • PDF