• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권1호
• /
• pp.1-9
• /
• 2000

In this paper, a design method of fault-tolerance is presented for the nuclear digital control systems composed of software and hardware. As a quantitative design method measure of fault-tolerance, we used Reliability, Availability and Safety. To implement the proposed fault-tolerance, a prototype system has been devised for the digital control systems and a quantitative method of 'Markovian Model' is applied. The results provide the appropriate degree of redundancy and diversity, and fail-safe.

• 산업공학
• /
• 제8권2호
• /
• pp.161-169
• /
• 1995

In this paper, a threshold policy is considered for the Markovian queueing system with server vacations. The threshold policy considered in this paper has the following form: "when the number of customers present in the system increases to N, the server is turned on and serves customers until the system becomes empty". In this paper, we show how the finite capacity or finite population queueing system under a threshold policy can be modeled by the stochastic Petri net. The performance evaluation of the model is carried out using the software called "SPNP". Some examples are also presented in which it is shown that how the optimal threshold policies can be obtained under a linear cost structure.

• 한국항해학회지
• /
• 제16권1호
• /
• pp.94-97
• /
• 1992

In this paper, the individual number of the future has depended not only upon the present individual number but upon the present individual age, considering the stochastic process model of individual number when the life span of each individual number and the individual age as a set, this becomes a Markovian. Therefore, in this paper the individual is treated as invariable, without depending upon the whole record of each individual since its birth. As a result, suppose {N(t), t>0} be a counting process and also suppose $Z_n$ denote the life span between the (n-1)st and the nth event of this process, (n{$geq}1$) : that is, when the first individual is established at n=1(time, 0), the Z$Z_n$ at time nth individual breaks, down. Random walk $Z_n$ is $Z_n=X_1+X_2+{\cdots}{\cdots}+X_A, Z_0=0$ So, fixed time t, the stochastic model is made up as follows ; A) Recurrence (Regeneration)number between(0.t) $N_t=max{n ; Z_n{\leq}t}$ B) Forwardrecurrence time(Excess life) $T^-I_t=Z_{Nt+1}-t$ C) Backward recurrence time(Current life) $T^-_t=t-Z_{Nt}$

• Communications for Statistical Applications and Methods
• /
• 제17권6호
• /
• pp.891-898
• /
• 2010

소프트웨어는 독립적으로 개발된 모듈들을 통합하는 개발과정을 거치며, 통합된 소프트웨어는 가용도, 소프트웨어에 내재된 결함의 제거 수 및 주어진 업무(task)들의 처리능력에 의하여 성능이 평가된다. 본 연구에서는 Lee와 Park (2003)의 마코프 불완전 수리모형을 기반으로 모듈들로 구성된 소프트웨어의 업무처리 능력을 평가할 수 있는 업무의 완전처리확률(completion probability)을 유도하며, 이와함께 개발된 소프트웨어가 출하되는 최적의 시점을 결정하는 방안을 제시하고자 한다.

• 제어로봇시스템학회논문지
• /
• 제19권8호
• /
• pp.718-724
• /
• 2013

In today's automotive industry, there exist several systems that help drivers reduce the possibility of accidents, such as the ADAS (Advanced Driver Assistance System). The ADAS helps drivers make correct and quick decisions during dangerous situations. This study analyzed the performance of the IMM (Interacting Multiple Model) method based on multiple Kalman filters using the data acquired from a driving simulator. An IMM algorithm is developed to identify the current discrete state of neighboring vehicles using the sensor data and the vehicle dynamics. In particular, the driving modes of the neighboring vehicles are classified by the cruising and maneuvering modes, and the transition between the states is modeled using a Markovian switching coefficient. The performance of the IMM algorithm is analyzed through realistic simulations where a target vehicle executes sudden lane change or acceleration maneuver.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1532-1553
• /
• 2014

Radio spectrum is a precious resource and characterized by fixed allocation policy. However, a large portion of the allocated radio spectrum is underutilized. Conversely, the rapid development of ubiquitous wireless technologies increases the demand for radio spectrum. Cognitive Radio (CR) methodologies have been introduced as a promising approach in detecting the white spaces, allowing the unlicensed users to use the licensed spectrum thus realizing Dynamic Spectrum Access (DSA) in an effective manner. This paper proposes a generalized framework for DSA between the licensed (primary) and unlicensed (secondary) users based on Continuous Time Markov Chain (CTMC) model. We present a spectrum access scheme in the presence of sensing errors based on CTMC which aims to attain optimum spectrum access probabilities for the secondary users. The primary user occupancy is identified by spectrum sensing algorithms and the sensing errors are captured in the form of false alarm and mis-detection. Simulation results show the effectiveness of the proposed spectrum access scheme in terms of the throughput attained by the secondary users, throughput optimization using optimum access probabilities, probability of interference with increasing number of secondary users. The efficacy of the algorithm is analyzed for both imperfect spectrum sensing and perfect spectrum sensing.

• Journal of applied mathematics & informatics
• /
• 제39권5_6호
• /
• pp.601-616
• /
• 2021

Retrial queueing models have been studied extensively in the literature. These have many practical applications, especially in service sectors. However, retrial queueing models have their own limitations. Typically, analyzing such models involve level-dependent quasi-birth-and-death processes, and hence some form of a truncation or an approximate method or simulation approach is needed to study in steady-state. Secondly, in general, the customers are not served on a first-come-first-served basis. The latter is the case when a new arrival may find a free server while prior arrivals are waiting in the retrial orbit due to the servers being busy during their arrivals. In this paper, we take a different approach to the study of multi-server retrial queues in which the signals are generated in such a way to provide a reasonably fair treatment to all the customers seeking service. Further, this approach makes the study to be level-independent quasi-birth-and-death process. This approach is different from any considered in the literature. Using matrix-analytic methods we analyze MAP/M/c-type retrial queueing models along with Poisson signals in steady-state. Illustrative numerical examples including a comparison with previously published retrial queues are presented and they show marked improvements in providing a quality of service to the customers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1098-1115
• /
• 2010

An inseparable challenge associated with every random access network is the design of an efficient Collision Resolution Algorithm (CRA), since collisions cannot be completely avoided in such network. To maximize the collision resolution efficiency of a popular CRA, namely Binary Exponential Backoff (BEB), we propose a reactive backoff algorithm. The proposed backoff algorithm is reactive in the sense that it updates the contention window based on the previously selected backoff value in the failed contention stage to avoid a typical type of collision, referred as cross-collision. Cross-collision would occur if the contention slot pointed by the currently selected backoff value appeared to be present in the overlapped portion of the adjacent (the previous and the current) windows. The proposed reactive algorithm contributes to significant performance improvements in the network since it offers a supplementary feature of Cross Collision Exclusion (XCE) and also retains the legacy collision mitigation features. We formulate a Markovian model to emulate the characteristics of the proposed algorithm. Based on the solution of the model, we then estimate the throughput and delay performances of WLAN following the signaling mechanisms of the Distributed Coordination Function (DCF) considering IEEE 802.11b system parameters. We validate the accuracy of the analytical performance estimation framework by comparing the analytically obtained results with the results that we obtain from the simulation experiments performed in ns-2. Through the rigorous analysis, based on the validated model, we show that the proposed reactive cross collision exclusionary backoff algorithm significantly enhances the throughput and reduces the average packet delay in the network.

• 물과 미래
• /
• 제26권3호
• /
• pp.113-124
• /
• 1993

본 연구는 금강하구호의 운영정책을 효율적으로 수립할 수 있도록, 2단계 추이모형으로부터 저수지 정상분포와 공수도달시간을 평가하는 데 있다. 이를 위해서 저수량과 유량의 결합분포에 이산 Markov과정을 도입하였으며, 저수지 유입량 분포로는 이항분포를 이용하였다. 계산결과, 대청댐 건설이전인 1952년부터 1980년 유량자료로부터 갈수시 자기 상관계수의 도입에 따른 저수지 정상분포의 공수확률은 0.952에서 0.904로 감소하며, 대청댐 건설이후인 1981-1989년까지는 저수지 정상분포의 공수확률은 0.900에서 0.829로 감소하였다. 한편 평균공수도달시간은 초기 저수량이 1단위에서 댐건설전은 23일에서 37일로 증가하며, 건설후는 29일에서 61일로 증가하는 것으로 나타났다. 이는 비교적 용량이 적은 금강하구호에서 저수율이 낮을 때 정상분포, 공수도달시간 등이 저수지 유입량의 자기상관계수에 따라 변화함을 알 수 있다. 따라서 갈수시 감강하구호의 효율적인 이수관리를 위해서는 유입량의 자기상관성을 고려해야 한다.

• 한국통신학회논문지
• /
• 제19권5호
• /
• pp.805-814
• /
• 1994

본 논문에서는 실패상태와 성공상태를 포함시키는 보조 Markov 천이행렬을 이용하여 패킷무선망의 성능을 구할 수 있는 새로운 분석방식을 제시하고 패킷오류 발생이 송신 PRU의 수 X와 수신 PRU의 수 R로 이루어지는 망상태(X, R)의 변화에 미치는 영향을 고려한다. 패킷무선망은 연속시간 Markov 체인 모델 그리고 무선채널은 경판정 Viterbi복호기와 비트변환확산부호계열을 이용한 DS/BPSK CDMA에 대하여 검토한다. 슬롯되지 않은 분산된 다중도약 패킷무선망에서 무선채널의 채널심볼오류가 패킷오류 발생에 미치는 진행과정은 Poisson 분포 그리고 오류발생시간을 지수분포로 가정한다. 신호대 잡음비와 심볼당 확산부호계열의 칩수와 같은 무선채널의 매개변수와 PRU의 수와 허용된 트래픽율과 같은 망의 매개변수를 갖는 함수로 망처리량을 구함으로써 Markov 패킷무선망과 부호화된 DS/BPSK 무선채널을 결합하여 종합적으로 분석할 수 있음을 보인다.