Informational and Causal Architecture of Discrete-Time Renewal Processes

نویسندگان

  • Sarah Marzen
  • James P. Crutchfield
چکیده

SFI Working Papers contain accounts of scienti5ic work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-­‐reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at SFI, inspired by an invited visit to or collaboration at SFI, or funded by an SFI grant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Informational and Causal Architecture of Continuous-time Renewal and Hidden Semi-Markov Processes

We introduce the minimal maximally predictive models ( -machines) of processes generated by certain hidden semi-Markov models. Their causal states are either hybrid discrete-continuous or continuous random variables and causal-state transitions are described by partial differential equations. Closed-form expressions are given for statistical complexities, excess entropies, and differential info...

متن کامل

Extended Geometric Processes: Semiparametric Estimation and Application to ReliabilityImperfect repair, Markov renewal equation, replacement policy

Lam (2007) introduces a generalization of renewal processes named Geometric processes, where inter-arrival times are independent and identically distributed up to a multiplicative scale parameter, in a geometric fashion. We here envision a more general scaling, not necessar- ily geometric. The corresponding counting process is named Extended Geometric Process (EGP). Semiparametric estimates are...

متن کامل

DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

متن کامل

Applications to continuous-time processes of computational techniques for discrete-time renewal processes

For optimising maintenance, the total costs should be computed over a bounded or unbounded time horizon. In order to determine the expected costs of maintenance, renewal theory can be applied when we can identify renewals that bring a component back into the as-good-as-new condition. This publication presents useful computational techniques to determine the probabilistic characteristics of a re...

متن کامل

Computational techniques for discrete-time renewal processes

For applying life-cycle costing, the total costs should be computed over a bounded or unbounded time horizon. In order to determine the expected costs of maintenance, renewal theory can be applied when we can identify renewals that bring a component back into the as-good-as-new condition. This paper presents useful computational techniques to determine the probabilistic characteristics of a ren...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Entropy

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2015