• 제목/요약/키워드: dynamic scheduling

검색결과 524건 처리시간 0.027초

풍력발전의 변동성을 고려한 기동정지계획에서의 적정 Ramping 용량 산정 (Evaluation of Ramping Capability for Day-ahead Unit Commitment considering Wind Power Variability)

  • 류재근;허재행;박종근
    • 전기학회논문지
    • /
    • 제62권4호
    • /
    • pp.457-466
    • /
    • 2013
  • Wind energy is rapidly becoming significant generating technologies in electricity markets. As probabilistic nature of wind energy creates many uncertainties in the short-term scheduling, additional actions for reliable market operation should be taken. This paper presents a novel approach to evaluate ramping capability requirement for changes in imbalance energy between day-ahead market and real-time market due to uncertainty of wind generation as well as system load. Dynamic ramp rate model has been applied for realistic solution in unit commitment problem, which is implemented in day-ahead market. Probabilistic optimal power flow has been used to verify ramping capability determined by the proposed method is reasonable in economic and reliable aspects. This approach was tested on six-bus system and IEEE 118-bus system with a wind farm. The results show that the proposed approach provides ramping capability information to meet both forecasted variability and desired confidence level of anticipated uncertainty.

Optimal Scheduling of Drug Treatment for HIV Infection;Continuous Dose Control and Receding Horizon Control

  • Shim, H.;Han, S.J.;Jeong, I.S.;Huh, Y.H.;Chung, C.C.;Nam, S.W.;Seo, J.H.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.1951-1956
    • /
    • 2003
  • It is known that HIV (Human Immunodeficiency Virus) infection, which causes AIDS after some latent period, is a dynamic process that can be modeled mathematically. Effects of available anti-viral drugs, which prevent HIV from infecting healthy cells, can also be included in the model. In this paper we illustrate control theory can be applied to a model of HIV infection. In particular, the drug dose is regarded as control input and the goal is to excite an immune response so that the symptom of infected patient should not be developed into AIDS. Finite horizon optimal control is employed to obtain the optimal schedule of drug dose since the model is highly nonlinear and we want maximum performance for enhancing the immune response. From the simulation studies, we find that gradual reduction of drug dose is important for the optimality. We also demonstrate the obtained open-loop optimal control is vulnerable to parameter variation of the model and measurement noise. To overcome this difficulty, we finally present nonlinear receding horizon control to incorporate feedback in the drug treatment.

  • PDF

Channel Quantization for Block Diagonalization with Limited Feedback in Multiuser MIMO Downlink Channels

  • Moon, Sung-Hyun;Lee, Sang-Rim;Kim, Jin-Sung;Lee, Inkyu
    • Journal of Communications and Networks
    • /
    • 제16권1호
    • /
    • pp.1-9
    • /
    • 2014
  • Block diagonalization (BD) has been proposed as a simple and effective technique in multiuser multiple-input multiple-output (MU-MIMO) broadcast channels. However, when channel state information (CSI) knowledge is limited at the transmitter, the performance of the BD may be degraded because inter-user interference cannot be completely eliminated. In this paper, we propose an efficient CSI quantization technique for BD precoded systems with limited feedback where users supported by a base station are selected by dynamic scheduling. First, we express the received signal-to-interference-plus-noise ratio (SINR) when multiple data streams are transmitted to the user, and derive a lower bound expression of the expected received SINR at each user. Then, based on this measure, each user determines its quantized CSI feedback information which maximizes the derived expected SINR, which comprises both the channel direction and the amplitude information. From simulations, we confirm that the proposed SINR-based channel quantization scheme achieves a significant sum rate gain over the conventional method in practical MU-MIMO systems.

Designing Smart-tag based Logistics System with Intelligent Track and Trace Service

  • Oh, Se-Won;Park, Joo-Sang;Lee, Yong-Joon
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.244-247
    • /
    • 2003
  • All over the value chain, a logistics information system must satisfy several requirements about gathering and sharing related information. For example, distributors or forwarders need up-to-date information for scheduling and managing their logistics resources. Meanwhile, consignors or consignees want to know the dynamic information about current states or location of their goods. Such information is dependent upon the quality of data sets collected throughout the logistics processes. Thus, gathering accurate data promptly is the essential factor for the success of a logistics information system. However, there are limits in reducing both time-gap and man-power for datn sourcing, since this process is done manually or by using bar codes and scanning devices. Smart-tag can be the alternative to such n time-consuming and inefficient operation, especially for handling piles of goods. The tag includes a micro-chip containing data which is remotely readable by readers with antenna. Logistics system with Smart tag can provide all the information anywhere and anytime, and it will increase the efficiency of logistics and satisfaction of users. In this paper, we propose a conceptual architecture for smart-tag based logistics system and describe its functions.

  • PDF

Image Completion using Belief Propagation Based on Planar Priorities

  • Xiao, Mang;Li, Guangyao;Jiang, Yinyu;Xie, Li;He, Ye
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4405-4418
    • /
    • 2016
  • Automatic image completion techniques have difficulty processing images in which the target region has multiple planes or is non-facade. Here, we propose a new image completion method that uses belief propagation based on planar priorities. We first calculate planar information, which includes planar projection parameters, plane segments, and repetitive regularity extractions within the plane. Next, we convert this planar information into planar guide knowledge using the prior probabilities of patch transforms and offsets. Using the energy of the discrete Markov Random Field (MRF), we then define an objective function for image completion that uses the planar guide knowledge. Finally, in order to effectively optimize the MRF, we propose a new optimization scheme, termed Planar Priority-belief propagation that includes message-scheduling-based planar priority and dynamic label cropping. The results of experiment show that our approach exhibits advanced performance compared with existing approaches.

무선 센서 네트워크에서 공평성을 고려한 T-MAC 프로토콜 (A Fairness Based T-MAC Protocol in Wireless Sensor Network)

  • 남재현
    • 한국정보통신학회논문지
    • /
    • 제17권6호
    • /
    • pp.1496-1501
    • /
    • 2013
  • IEEE 802.11은 무선 네트워크에서 주된 기술로 자리를 잡고있다. 하지만 공평성 문제가 에드 �N 네트워크 상에서 발생한다. 두 개의 독립적인 송신 노드들이 매체를 독점하여 사용함으로써 중간의 다른 노드가 패킷을 전송하는 것을 막는 현상까지 발생한다. 본 논문에서는 (m,k)-firm 기법을 사용하여 T-MAC에서 발생할 수 있는 불공정 대역폭 분배 문제를 해결하였다. 즉, k 번 시도 중에 연속적으로 m 번의 매체 접근 기회를 가지지 못한 노드에게 제일 높은 우선순위를 제공하여 주위의 다른 노드들 간의 전송 때문에 자신이 전송하지 못하는 경우를 줄였다. 시뮬레이션 결과 제안된 스케줄링 기법이 기존 기법보다 트래픽을 전송할 기회를 가질 확률이 증가되는 것을 볼 수 있다.

Inter-Cell Interference Management for Next-Generation Wireless Communication Systems

  • Kwon, Ho-Joong;Ko, Soo-Min;Seo, Han-Byul;Lee, Byeong-Gi
    • Journal of Communications and Networks
    • /
    • 제10권3호
    • /
    • pp.258-267
    • /
    • 2008
  • In this paper, we examine what changes the next-generation wireless communication systems will experience in terms of the technologies, services, and networks and, based on that, we investigate how the inter-cell interference management should evolve in various aspects. We identify that the main driving forces of the future changes involve the data-centric services, new dynamic service scenarios, all-IP core access networks, new physical-layer technologies, and heavy upload traffic. We establish that in order to cope with the changes, the next-generation inter-cell interference management should evolve to 1) set the objective of providing a maximal data rate, 2) take the form of joint management of power allocation and user scheduling, 3) operate in a fully distributed manner, 4) handle the time-varying channel conditions in mobile environment, 5) deal with the changes in interference mechanism triggered by the new physical-layer technologies, and 6) increase the spectral efficiency while avoiding centralized coordination of resource allocation of the users in the uplink channel.

Assessment of Position Degradation Due to Intermittent Broadcast of RTK MSM Correction Under Various Conditions

  • Yoon, Hyo Jung;Lim, Cheol soon;Park, Byungwoon
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제9권3호
    • /
    • pp.237-248
    • /
    • 2020
  • GNSS has been evolving dramatically in recent years. There are currently 6 GNSS (4 GNSS, AND 2 RNSS) constellations, which are GPS (USA), GLONASS (Russia), BeiDou (China), Galileo (EU), QZSS (Japan), and IRNSS (India). The Number of navigation satellites is expected to be over 150 by 2020. As the number of both constellations and satellites used for the improvement of positioning performance, high accuracy, and robustness of precise positioning is more promising. However, a large amount of the correction messages is required to support the augmentation system for the available satellites of all the constellations. Since bandwidth for the correction messages is generally limited, sending or scheduling the correction messages might be a critical issue in the near future. In this study, we analyze the relationship between the size of the bandwidth and Real-Time Kinematics (RTK) performance. Multiple Signal Messages (MSM), the only Radio Technical Commission for Maritimes (RTCM) message that supports multi-constellation GNSS, has been used for this assessment. Instead of the conventional method that broadcasts all the messages at the same time, we assign the MSM broadcasting interval for each constellation in 5 seconds. An open sky static and dynamic test for this study was conducted on the roof of Sejong University. Our results show that the RTK fixed position accuracy is not affected by the 5-second interval corrections, but the ambiguity fixing rate is degraded for poor DOP cases when RTK correction are transmitted intermittently.

무선 ATM 서비스를 위한 CDMA 시스템 : 접속 방식과 무선망 제어 알고리즘 (A CDMA System for Wireless ATM Service: Access Method and Control Algorithm)

  • 임광재;곽경섭
    • 한국통신학회논문지
    • /
    • 제24권6A호
    • /
    • pp.803-819
    • /
    • 1999
  • 본 논문은 무선 ATM 서비스를 위한 CDMA WATM 시스템을 제시하며, 매체 접속 방식으로 전송 스케줄링과 슬롯 및 무선 링크 할당 알고리즘을 가진 중앙 제어 예약 접속 방식 (CRMA/TSDA)을 제안한다. 또한, 본 논문에서는 CDMA WATM 시스템을 위한 무선 접속 및 링크 제어 방식으로 지역정보 슬롯 및 링크 할당 알고리즘과 광역정보 슬롯 및 링크 할당 알고리즘을 제안하고, 모의 실험을 통하여 양방향 링크에서의 시스템 용량과 성능을 분석하였다. 제시된 접속 방식 및 제어 방식은 기존의 CDMA 랜덤 접속 방식에 비해 만족할 만한 성능을 보이며, ATM 서비스의 요구 품질을 만족시키며 수용할 수 있다. 특히, 지역 정보 제어 방식은 준최적의 광역 정보 방식에 견줄만한 성능을 갖는다.

  • PDF

Performance Evaluation and Analysis of Multiple Scenarios of Big Data Stream Computing on Storm Platform

  • Sun, Dawei;Yan, Hongbin;Gao, Shang;Zhou, Zhangbing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권7호
    • /
    • pp.2977-2997
    • /
    • 2018
  • In big data era, fresh data grows rapidly every day. More than 30,000 gigabytes of data are created every second and the rate is accelerating. Many organizations rely heavily on real time streaming, while big data stream computing helps them spot opportunities and risks from real time big data. Storm, one of the most common online stream computing platforms, has been used for big data stream computing, with response time ranging from milliseconds to sub-seconds. The performance of Storm plays a crucial role in different application scenarios, however, few studies were conducted to evaluate the performance of Storm. In this paper, we investigate the performance of Storm under different application scenarios. Our experimental results show that throughput and latency of Storm are greatly affected by the number of instances of each vertex in task topology, and the number of available resources in data center. The fault-tolerant mechanism of Storm works well in most big data stream computing environments. As a result, it is suggested that a dynamic topology, an elastic scheduling framework, and a memory based fault-tolerant mechanism are necessary for providing high throughput and low latency services on Storm platform.