• Title/Summary/Keyword: Markov-chain

Search Result 890, Processing Time 0.026 seconds

EARLY WARNING FORECASTS FOR COVID-19 IN KOREA USING BAYESIAN ESTIMATION OF THE TRANSMISSION RATE

  • Byul Nim Kim
    • East Asian mathematical journal
    • /
    • v.39 no.5
    • /
    • pp.493-503
    • /
    • 2023
  • Tendency prediction of daily confirmed cases is an important issue for public health authorities. To protect the tendency, we estimate the transmission rate of stochastic SEIR model for COVID-19 in Korea using particle Markov chain Monte Carlo method. The results show that the increasing and decreasing tendency of estimated transmission rate appear one or two days in advance compared to daily incidence cases, and as time evolves the standard deviation of the estimates of transmission rate reduces. Since ten months have passed since the first incident case of COVID-19 in Korea, we expect to forecast the tendency of daily confirmed cases for the next one or two days more accurately using our method.

An Analysis of the Effect of IEEE 802.15.4 Contention Window Size to Throughput and Energy Consumption (IEEE 802.15.4에서 Contention Window 크기 변화가 데이터 처리량과 에너지 소비량에 미치는 영향 분석)

  • Noh, Ki-chol;Ye, Seok-Hwan;Lee, Kang-woo;Ahn, Jong-Suk
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.1136-1139
    • /
    • 2009
  • 본 논문은 802.15.4에서 CW(Contention Window)에 따른 성능과 에너지 소비량을 분석한다. 기존 연구에서는 802.15.4 표준안의 성능과 에너지 소비량을 분석하고, CW나 BE(Backoff Exponent)와 같은 변수를 변화시켜 시뮬레이션만으로 성능과 에너지 소비량을 비교하여 분석하였으나, 본 논문은 CW에 따른 성능과 에너지 소비량을 마코프 체인(Markov Chain)을 이용하여 수학적으로 분석을 하였다.

A Bayesian joint model for continuous and zero-inflated count data in developmental toxicity studies

  • Hwang, Beom Seuk
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.2
    • /
    • pp.239-250
    • /
    • 2022
  • In many applications, we frequently encounter correlated multiple outcomes measured on the same subject. Joint modeling of such multiple outcomes can improve efficiency of inference compared to independent modeling. For instance, in developmental toxicity studies, fetal weight and number of malformed pups are measured on the pregnant dams exposed to different levels of a toxic substance, in which the association between such outcomes should be taken into account in the model. The number of malformations may possibly have many zeros, which should be analyzed via zero-inflated count models. Motivated by applications in developmental toxicity studies, we propose a Bayesian joint modeling framework for continuous and count outcomes with excess zeros. In our model, zero-inflated Poisson (ZIP) regression model would be used to describe count data, and a subject-specific random effects would account for the correlation across the two outcomes. We implement a Bayesian approach using MCMC procedure with data augmentation method and adaptive rejection sampling. We apply our proposed model to dose-response analysis in a developmental toxicity study to estimate the benchmark dose in a risk assessment.

Performance measurement of safety-critical systems based on ordinary differential equations and Petri nets: A case study of nuclear power plant

  • Nand Kumar Jyotish;Lalit Kumar Singh;Chiranjeev Kumar
    • Nuclear Engineering and Technology
    • /
    • v.55 no.3
    • /
    • pp.861-869
    • /
    • 2023
  • This article proposes a novel approach to measure the performance of Safety-Critical Systems (SCS). Such systems contain multiple processing nodes that communicate with each other is modeled by a Petri nets (PN). The paper uses the PN for the performance evaluation of SCS. A set of ordinary differential equations (ODEs) is derived from the Petri net model that represent the state of the system, and the solutions can be used to measure the system's performance. The proposed method can avoid the state space explosion problem and also introduces new metrics of performance, along with their measurement: deadlock, liveness, stability, boundedness, and steady state. The proposed technique is applied to Shutdown System (SDS) of Nuclear Power Plant (NPP). We obtained 99.887% accuracy of performance measurement, which proves the effectiveness of our approach.

Performance Improvement of Frame Synchronization in the 90Mb/s Optical Transmission System (90Mb/s 광전송시스템의 프레임 동기방식에 관한 성능 개선)

  • Shin, Dong Kwan;Lee, Man Seop;Kim, Yong Hwan
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.2
    • /
    • pp.183-189
    • /
    • 1987
  • The performance of frame synchronization can be represented by the values of three characteristic variables-average misframe interval, average syncloss detection time, average reframe time. In this paper, we have analyzed the performance of frame synchronization of the standardized 90Mb/s optical transmission system by Markov chain method, with the suggestion of an extended algorithm for performance improvement. Maximum average reframe time of 1.18 ms can be obtained by the suggested algorithm, which is compared with that of 2.28 ms for the existing algorithm.

  • PDF

An input-buffer ATM switch based on the dynamic change of the threshold for the occupancy of the buffer (버퍼에 설정된 점유 임계치의 동적 변화에 기초한 입력버퍼형 ATM 스위치)

  • Paik, Jung-Hoon;Lim, Chae-Tak
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.2
    • /
    • pp.19-27
    • /
    • 1999
  • This paper propose a contention resolution policy featuring dynamic change of the threshold for the occupancy of the input buffer for an input buffering ATM switching architecture and its hardware implementation strategy. The strategy is provided with the aim of the simple structure that achieves the reduction of the signal path and the power consumption. The threshold is changed dynamically every time slot based both the arrived of cells and the cell service resulting from the contention resolution. The performance on the cell loss of the proposed policy is performed and compared with the conventional policy under the diverse traffic conditions through both the analysis based ont the Markov chain and the simulation.

  • PDF

Performance Analysis of CDMA Reservation ALOHA for Multi-traffic Services (다중 트랙픽 지원을 위한 CDMA 예약 ALOHA 방안의 성능 분석)

  • Jo, Chun Geun;Heo, Gyeong Mu;Lee, Yeon U;Cha, Gyun Hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.12A
    • /
    • pp.1852-1861
    • /
    • 1999
  • In this paper, CDMA Reservation ALOHA scheme which can reduce multiple access interference and packet collision is proposed to support multi-traffic such as voice and random data with and without priority. In this scheme, the time slot is divided into two stage, access and transmission stage. Only packets with spreading codes assigned from base station in access stage can transmit their packets in transmission stage, so MAI can be reduced. To reduce packer collision in access stage, the code reservation and access permission probability are used. Code reservation is allowed for voice traffic and continuous traffic with priority using piggyback and access permission probability based on the estimation of the number of contending users in the steady-state is adaptively applied to each traffic terminal. Also, we analyzed and simulated the numerical performances required for each traffic using Markov chain modeling in a single cell environment.

  • PDF

A Distributed Trust Model Based on Reputation Management of Peers for P2P VoD Services

  • Huang, Guimin;Hu, Min;Zhou, Ya;Liu, Pingshan;Zhang, Yanchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2285-2301
    • /
    • 2012
  • Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.

Reliability Analysis of Multi-functional Multi-state Standby System Using Weibull Distribution (와이블 분포를 이용한 다기능 다중상태 대기시스템의 신뢰도 분석)

  • Kim, Ji-Hye;Chung, Young-Bae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.3
    • /
    • pp.138-147
    • /
    • 2017
  • As the functions and structure of the system are complicated and elaborated, various types of structures are emerging to increase reliability in order to cope with a system requiring higher reliability. Among these, standby systems with standby components for each major component are mainly used in aircraft or power plants requiring high reliability. In this study, we consider a standby system with a multi-functional standby component in which one standby component simultaneously performs the functions of several major components. The structure of a parallel system with multifunctional standby components can also be seen in real aircraft hydraulic pump systems and is very efficient in terms of weight, space, and cost as compared to a basic standby system. All components of the system have complete operation, complete failure, only two states, and the system has multiple states depending on the state of the component. At this time, the multi-functional standby component is assumed to be in a non-operating standby state (Cold Standby) when the main component fails. In addition, the failure rate of each part follows the Weibull distribution which can be expressed as increasing type, constant type, and decreasing type according to the shape parameter. If the Weibull distribution is used, it can be applied to various environments in a realistic manner compared to the exponential distribution that can be reflected only when the failure rate is constant. In this paper, Markov chain analysis method is applied to evaluate the reliability of multi-functional multi-state standby system. In order to verify the validity of the reliability, a graph was generated by applying arbitrary shape parameters and scale parameter values through Excel. In order to analyze the effect of multi-functional multi-state standby system using Weibull distribution, we compared the reliability based on the most basic parallel system and the standby system.

Investigating Binding Area of Protein Surface using MCL Algorithm (MCL 알고리즘을 이용한 단백질 표면의 바인딩 영역 분석 기법)

  • Jung, Kwang-Su;Yu, Ki-Jin;Chung, Yong-Je;Ryu, Keun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.743-752
    • /
    • 2007
  • Proteins combine with other materials to achieve their function and have similar function if their active sites are similar. Thus we can infer the function of protein by identifying the binding area of proteins. This paper suggests the novel method to select binding area of protein using MCL (Markov Cluster) algorithm. We construct the distance matrix from surface residues distance on protein. Then this distance matrix is transformed to connectivity matrix for applying MCL process. We adopted Catalytic Site Atlas (CSA) data to evaluate the proposed method. In the experimental result using CSA data (94 selected single chain proteins), our algorithm detects the 91 (97%) binding area near by active site of each protein. We introduced a new geometrical features and this mainly contributes to reduce the time to analyze the protein by selecting the residues near by active site.