• Title/Summary/Keyword: random-time

Search Result 2,699, Processing Time 0.027 seconds

Evaluation of the Performance and Reliability of a Real-time Power System Described by a DES Model using Fuzzy-Random Variables (퍼지-랜덤 변수를 이용한 DES 모델링을 통한 실시간 전력 시스템의 성능 및 신뢰도 평가)

  • Min, Byeong-Jo;Lee, Seok-Ju;Kim, Hak-Bae
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.7
    • /
    • pp.363-369
    • /
    • 2000
  • To flexibly evaluate performance and reliability of an electric power system in the aspect of the real-time system which is intrinsically characterized by stringent timing constraints fails catastrophically if its control input is not updated by its digital controller computer within a certain time limit called the hard deadline, we propose fuzzy-random variables and build a discrete event model embedded with fuzzy-random variables. Also, we adapt fuzzy-variables to a path-space approach, which derives the upper and lower bounds of reliability by using a semi-Markov model that explicitly contains the deadline information. Consequently, we propose certain formulas of state automata properly transformed by fuzzy-random variables, and present numerical examples applying the formulas as well.

  • PDF

Processing Time and Traffic Capacity Analysis for RFID System Using LBT-Random Searching Scheme (LBT-Random Searching 방식을 채용한 RFID 시스템의 트래픽 처리 시간 및 용량 해석)

  • Hwang, In-Kwan;Lim, Yeon-Jun;Pyo, Cheol-Sig
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9A
    • /
    • pp.822-829
    • /
    • 2005
  • In this paper, a processing time and trafnc capacity analysis algorithm for RFID system using LBT-Random Searching scheme is proposed. Service time, carrier sensing time, additional delay time required for contiguous frequency channel occupancy, and additional delay time required for the contiguous using the same frequency channel are considered and the processing delay and frequency channel capacity are analyzed for the steady state operation of the system. The simulation results showing maximum capacity of the system and explaining the accuracy of the algorithm are provided.

A Batch Arrival Queue with a Random Setup Time Under Bernoulli Vacation Schedule

  • Choudhury, Gautam;Tadj, Lotfi;Paul, Maduchanda
    • Management Science and Financial Engineering
    • /
    • v.15 no.2
    • /
    • pp.1-21
    • /
    • 2009
  • We consider an $M^x/G/1$ queueing system with a random setup time under Bernoulli vacation schedule, where the service of the first unit at the completion of each busy period or a vacation period is preceded by a random setup time, on completion of which service starts. However, after each service completion, the server may take a vacation with probability p or remain in the system to provide next service, if any, with probability (1-p). This generalizes both the $M^x/G/1$ queueing system with a random setup time as well as the Bernoulli vacation model. We carryout an extensive analysis for the queue size distributions at various epochs. Further, attempts have been made to unify the results of related batch arrival vacation models.

Control of Visual Tracking System with a Random Time Delay (랜덤한 시간 지연 요소를 갖는 영상 추적 시스템의 제어)

  • Oh, Nam-Kyu;Choi, Goon-Ho
    • Journal of the Semiconductor & Display Technology
    • /
    • v.10 no.3
    • /
    • pp.21-28
    • /
    • 2011
  • In recent years, owing to the development of the image processing technology, the research to build control system using a vision sensor is stimulated. However, a random time delay must be considered, because it works of a various time to get a result of an image processing in the system. It can be seen as an obstacle factor to a control of visual tracking in real system. In this paper, implementing two vision controllers each, first one is made up PID controller and the second one is consisted of a Smith Predictor, the possibility was shown to overcome a problem of a random time delay in a visual tracking system. A number of simulations and experiments were done to show the validity of this study.

Adaptive and Prioritized Random Access and Resource Allocation Schemes for Dynamic TDMA/TDD Protocols

  • Choi, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.1
    • /
    • pp.28-36
    • /
    • 2017
  • The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

Estimation of Random Coefficient AR(1) Model for Panel Data

  • Son, Young-Sook
    • Journal of the Korean Statistical Society
    • /
    • v.25 no.4
    • /
    • pp.529-544
    • /
    • 1996
  • This paper deals with the problem of estimating the autoregressive random coefficient of a first-order random coefficient autoregressive time series model applied to panel data of time series. The autoregressive random coefficients across individual units are assumed to be a random sample from a truncated normal distribution with the space (-1, 1) for stationarity. The estimates of random coefficients are obtained by an empirical Bayes procedure using the estimates of model parameters. Also, a Monte Carlo study is conducted to support the estimation procedure proposed in this paper. Finally, we apply our results to the economic panel data in Liu and Tiao(1980).

  • PDF

Random number sensitivity in simulation of wind loads

  • Kumar, K. Suresh
    • Wind and Structures
    • /
    • v.3 no.1
    • /
    • pp.1-10
    • /
    • 2000
  • Recently, an efficient and practical method has been developed for the generation of univariate non-Gaussian wind pressure time histories on low building roofs; this methodology requires intermittent exponential random numbers for the simulation. On the other hand, the conventional spectral representation scheme with random phase is found suitable for the generation of univariate Gaussian wind pressure time histories on low building roofs; this simulation scheme requires uniform random numbers. The dependency of these simulation methodologies on the random number generator is one of the items affecting the accuracy of the simultion result; therefore, an attempt has been made to investigate the issue. This note presents the observed sensitivity of random number sets in repetitive simulations of Gaussian and non-Gaussian wind pressures.

Comparison of Random and Blocked Practice during Performance of the Stop Signal Task

  • Kwon, Jung-Won;Nam, Seok-Hyun;Kim, Chung-Sun
    • The Journal of Korean Physical Therapy
    • /
    • v.23 no.3
    • /
    • pp.65-70
    • /
    • 2011
  • Purpose: We investigated the changes in the stop-signal reaction time (SSRT) and the no-signal reaction time (NSRT) following motor sequential learning in the stop-signal task (SST). This study also determined which of the reduction0s of spatial processing time was better between blocked- and random-SST. Methods: Thirty right-handed healthy subjects without a history of neurological dysfunction were recruited. In all subjects, both the SSRT and the NSRT were measured for the SST. Tasks were classified into two categories based on the stop-signal patterns, the blocked-SST practice group and random-SST practice group. All subjects gave written informed consent. Results: In the blocked-SST group, both the SSRT and the NSRT was significantly decreased (p<0.05) but not significantly changed in the random-SST group. In the SSRT and the NSRT, the blocked-SST group was faster than the random-SST group (p<0.05). In the post-test SST after practice of each group, the SSRT was significantly decreased in the random-SST group (p<0.05), but the NSRT showed no significant changes in either group. Conclusion: These findings demonstrate that random-SST practice resulted in a decrease in internal processing times needed for a rapid stop to visual signals, indicating motor skill learning is acquired through improved response selection and inhibition.