Article1983

Moving window detection for discrete data (Corresp.)

37 citations0/0 files storedIEEE Transactions on Information Theory

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Statistical Process Monitoring Probability and Statistical Research Distributed Sensor Networks and Detection Algorithms

Abstract

The moving window detection procedure for discrete data is studied. Bounds for the probabilities and expected values of the waiting time for a detection are derived. The bounds are evaluated for independent identically distributed zero-one Bernoulli trials, binomial, and Poisson random variables, and also for the two-state stationary Markov chain. The results are applicable to the theory of radar detection, time sharing systems, and quality control.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 37 citations exist upstream.

References

1958Properties of Control Chart Zone Tests 1941Note on an Application of Runs to Quality Control Charts 1970Buffer Behavior for Poisson Arrivals and Multiple Synchronous Constant Outputs 1973On the Occurrence ofnSuccesses WithinNBernoulli Trials 1970The First Occurrence of n Successes in N Trials

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.