• Title/Summary/Keyword: stochastic Markov process model

Search Result 67, Processing Time 0.024 seconds

Optimal LNG Procurement Policy in a Spot Market Using Dynamic Programming (동적 계획법을 이용한 LNG 현물시장에서의 포트폴리오 구성방법)

  • Ryu, Jong-Hyun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.3
    • /
    • pp.259-266
    • /
    • 2015
  • Among many energy resources, natural gas has recently received a remarkable amount of attention, particularly from the electrical generation industry. This is in part due to increasing shale gas production, providing an environment-friendly fossil fuel, and high risk of nuclear power. Because South Korea, the world's second largest LNG importing nation after Japan, has no international natural gas pipelines and relies on imports in the form of LNG, the natural gas has been traditionally procured by long term LNG contracts at relatively high price. Thus, there is a need of developing an Asian LNG trading hub, where LNG can be traded at more competitive spot prices. In a natural gas spot market, the amount of natural gas to be bought should be carefully determined considering a limited storage capacity and future pricing dynamics. In this work, the problem to find the optimal amount of natural gas in a spot market is formulated as a Markov decision process (MDP) in risk neutral environment and the optimal base stock policy which depends on a stage and price is established. Taking into account price and demand uncertainties, the basestock target levels are simply approximated from dynamic programming. The simulation results show that the basestock policy can be one of effective ways for procurement of LNG in a spot market.

Asymmetric Information and Bargaining Delays (비대칭적 정보와 협상지연)

  • Choi, Chang-Kon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.4
    • /
    • pp.1683-1689
    • /
    • 2013
  • Applying Markov Stochastic Process theory, this paper attempts to suggest a tentative model explaining how private information may cause bargaining delay. It is shown that the bargaining delay is critically dependent on the specification of information. It turns out that the delay tends to be longer in bargaining where information is imperfect. This means that bargaining models frequently can have an infinite delay under imperfect information while they have finite delay of bargaining before reaching the agreements if information is perfect. Other interesting result is that bargaining delay may depend on who makes the offer first. And it is also shown that bargaining tends to end earlier if both players (seller and buyer) can make offers in turn than the case where only one side make a offer.

Robust Speech Recognition Using Missing Data Theory (손실 데이터 이론을 이용한 강인한 음성 인식)

  • 김락용;조훈영;오영환
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.3
    • /
    • pp.56-62
    • /
    • 2001
  • In this paper, we adopt a missing data theory to speech recognition. It can be used in order to maintain high performance of speech recognizer when the missing data occurs. In general, hidden Markov model (HMM) is used as a stochastic classifier for speech recognition task. Acoustic events are represented by continuous probability density function in continuous density HMM(CDHMM). The missing data theory has an advantage that can be easily applicable to this CDHMM. A marginalization method is used for processing missing data because it has small complexity and is easy to apply to automatic speech recognition (ASR). Also, a spectral subtraction is used for detecting missing data. If the difference between the energy of speech and that of background noise is below given threshold value, we determine that missing has occurred. We propose a new method that examines the reliability of detected missing data using voicing probability. The voicing probability is used to find voiced frames. It is used to process the missing data in voiced region that has more redundant information than consonants. The experimental results showed that our method improves performance than baseline system that uses spectral subtraction method only. In 452 words isolated word recognition experiment, the proposed method using the voicing probability reduced the average word error rate by 12% in a typical noise situation.

  • PDF

Optimal Buffer Allocation in Multi-Product Repairable Production Lines Based on Multi-State Reliability and Structural Complexity

  • Duan, Jianguo;Xie, Nan;Li, Lianhui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1579-1602
    • /
    • 2020
  • In the design of production system, buffer capacity allocation is a major step. Through polymorphism analysis of production capacity and production capability, this paper investigates a buffer allocation optimization problem aiming at the multi-stage production line including unreliable machines, which is concerned with maximizing the system theoretical production rate and minimizing the system state entropy for a certain amount of buffers simultaneously. Stochastic process analysis is employed to establish Markov models for repairable modular machines. Considering the complex structure, an improved vector UGF (Universal Generating Function) technique and composition operators are introduced to construct the system model. Then the measures to assess the system's multi-state reliability and structural complexity are given. Based on system theoretical production rate and system state entropy, mathematical model for buffer capacity optimization is built and optimized by a specific genetic algorithm. The feasibility and effectiveness of the proposed method is verified by an application of an engine head production line.

Parallel processing in structural reliability

  • Pellissetti, M.F.
    • Structural Engineering and Mechanics
    • /
    • v.32 no.1
    • /
    • pp.95-126
    • /
    • 2009
  • The present contribution addresses the parallelization of advanced simulation methods for structural reliability analysis, which have recently been developed for large-scale structures with a high number of uncertain parameters. In particular, the Line Sampling method and the Subset Simulation method are considered. The proposed parallel algorithms exploit the parallelism associated with the possibility to simultaneously perform independent FE analyses. For the Line Sampling method a parallelization scheme is proposed both for the actual sampling process, and for the statistical gradient estimation method used to identify the so-called important direction of the Line Sampling scheme. Two parallelization strategies are investigated for the Subset Simulation method: the first one consists in the embarrassingly parallel advancement of distinct Markov chains; in this case the speedup is bounded by the number of chains advanced simultaneously. The second parallel Subset Simulation algorithm utilizes the concept of speculative computing. Speedup measurements in context with the FE model of a multistory building (24,000 DOFs) show the reduction of the wall-clock time to a very viable amount (<10 minutes for Line Sampling and ${\approx}$ 1 hour for Subset Simulation). The measurements, conducted on clusters of multi-core nodes, also indicate a strong sensitivity of the parallel performance to the load level of the nodes, in terms of the number of simultaneously used cores. This performance degradation is related to memory bottlenecks during the modal analysis required during each FE analysis.

Online Adaptation of Control Parameters with Safe Exploration by Control Barrier Function (제어 장벽함수를 이용한 안전한 행동 영역 탐색과 제어 매개변수의 실시간 적응)

  • Kim, Suyeong;Son, Hungsun
    • The Journal of Korea Robotics Society
    • /
    • v.17 no.1
    • /
    • pp.76-85
    • /
    • 2022
  • One of the most fundamental challenges when designing controllers for dynamic systems is the adjustment of controller parameters. Usually the system model is used to get the initial controller, but eventually the controller parameters must be manually adjusted in the real system to achieve the best performance. To avoid this manual tuning step, data-driven methods such as machine learning were used. Recently, reinforcement learning became one alternative of this problem to be considered as an agent learns policies in large state space with trial-and-error Markov Decision Process (MDP) which is widely used in the field of robotics. However, on initial training step, as an agent tries to explore to the new state space with random action and acts directly on the controller parameters in real systems, MDP can lead the system safety-critical system failures. Therefore, the issue of 'safe exploration' became important. In this paper we meet 'safe exploration' condition with Control Barrier Function (CBF) which converts direct constraints on the state space to the implicit constraint of the control inputs. Given an initial low-performance controller, it automatically optimizes the parameters of the control law while ensuring safety by the CBF so that the agent can learn how to predict and control unknown and often stochastic environments. Simulation results on a quadrotor UAV indicate that the proposed method can safely optimize controller parameters quickly and automatically.

Genetic Contribution of Indigenous Yakutian Cattle to Two Hybrid Populations, Revealed by Microsatellite Variation

  • Li, M.H.;Nogovitsina, E.;Ivanova, Z.;Erhardt, G.;Vilkki, J.;Popov, R.;Ammosov, I.;Kiselyova, T.;Kantanen, J.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.18 no.5
    • /
    • pp.613-619
    • /
    • 2005
  • Indigenous Yakutian cattle' adaptation to the hardest subarctic conditions makes them a valuable genetic resource for cattle breeding in the Siberian area. Since early last century, crossbreeding between native Yakutian cattle and imported Simmental and Kholmogory breeds has been widely adopted. In this study, variations at 22 polymorphic microsatellite loci in 5 populations of Yakutian, Kholmogory, Simmental, Yakutian-Kholmogory and Yakutian-Simmental cattle were analysed to estimate the genetic contribution of Yakutian cattle to the two hybrid populations. Three statistical approaches were used: the weighted least-squares (WLS) method which considers all allele frequencies; a recently developed implementation of a Markov chain Monte Carlo (MCMC) method called likelihood-based estimation of admixture (LEA); and a model-based Bayesian admixture analysis method (STRUCTURE). At population-level admixture analyses, the estimate based on the LEA was consistent with that obtained by the WLS method. Both methods showed that the genetic contribution of the indigenous Yakutian cattle in Yakutian-Kholmogory was small (9.6% by the LEA and 14.2% by the WLS method). In the Yakutian-Simmental population, the genetic contribution of the indigenous Yakutian cattle was considerably higher (62.8% by the LEA and 56.9% by the WLS method). Individual-level admixture analyses using STRUCTURE proved to be more informative than the multidimensional scaling analysis (MDSA) based on individual-based genetic distances. Of the 9 Yakutian-Simmental animals studied, 8 showed admixed origin, whereas of the 14 studied Yakutian-Kholmogory animals only 2 showed Yakutian ancestry (>5%). The mean posterior distributions of individual admixture coefficient (q) varied greatly among the samples in both hybrid populations. This study revealed a minor existing contribution of the Yakutian cattle in the Yakutian-Kholmogory hybrid population, but in the Yakutian-Simmental hybrid population, a major genetic contribution of the Yakutian cattle was seen. The results reflect the different crossbreeding patterns used in the development of the two hybrid populations. Additionally, molecular evidence for differences among individual admixture proportions was seen in both hybrid populations, resulting from the stochastic process in crossing over generations.