English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study waiting time problems for first-order Markov dependent trials via conditional probability generating functions. Our models involve α frequency cells and β run cells with prescribed quotas and an additional γ slack cells without quotas. For any given and , in our Model I we determine the waiting time until at least frequency cells and at least run cells reach their quotas. For any given τ ≤ α + β, in our Model II we determine the waiting time until τ cells reach their quotas. Computer algorithms are developed to calculate the distributions, expectations and standard deviations of the waiting time random variables of the two models. Numerical results demonstrate the efficiency of the algorithms

Exact Distributions of Waiting Time Problems of Mixed Frequencies and Runs in Markov Dependent Trials