Skip to main content
SpringerLink
Log in

Off-line detection of a quasi-periodically recurring fragment in a numerical sequence

  • Mathematical Programming
  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

The paper considers a nontraditional—combinatorial—approach to solving the problem of a posteriori (off-line) noise-proof detection of a recurring fragment in a numerical sequence. Results are presented concerning the complexity, classification, and justification of algorithms for solving discrete extremal problems to which, within the combinatorial approach, some possible variants of this problem are reduced in the case when repetitions are quasi-periodic and the noise is additive.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Kel’manov and B. Jeon, IEEE Trans. Signal Process. 52(3), 645 (2004).

    Article  MathSciNet  Google Scholar 

  2. A. Wald, Sequential Analysis (Wiley, New York, 1947).

    MATH  Google Scholar 

  3. H. L. Van Trees, Detection, Estimation, and Modulation Theory. Part I (Wiley, New York, 1968).

    MATH  Google Scholar 

  4. C. W. Helstrom, Elements of Signal Detection and Estimation (Prentice-Hall, New York, 1979).

    Google Scholar 

  5. B. D. Anderson and J. D. Moore, Optimal Filtering (Prentice-Hall, New York, 1995).

    Google Scholar 

  6. I. V. Nikoforov, Sequential Detection of a Change in Properties of Time Series (Nauka, Moscow, 1983) [in Russian].

    Google Scholar 

  7. A. A. Zhiglyavskii and A. E. Kraskovskii, Detection of Discord of Random Processes in Radio Engineering Problems (Leningrad Gos. Univ., Leningrad, 1988) [in Russian].

    Google Scholar 

  8. Detection of Abrupt Changes in Signals and Dynamical Systems, Ed. by M. Basseville and A. Benveniste (Springer-Verlag, Berlin, 1985; Mir, Moscow, 1989).

    Google Scholar 

  9. N. Kligene and L. Tel’ksnis, Avtomat. i Telemekh. 10, 5 (1983).

    MathSciNet  Google Scholar 

  10. I. Sh. Torgovitskii, Zarubezhn. Radiolektron. 1, 3 (1976).

    Google Scholar 

  11. B. S. Darkhovskii, Teor. Veroyatnost. i Primenen. 29(3), 464 (1984).

    MathSciNet  Google Scholar 

  12. B. S. Darkhovskii, Teor. Veroyatnost. i Primenen. 30(4), 795 (1985).

    MathSciNet  Google Scholar 

  13. B. E. Brodskii and B. S. Darkhovskii, Teor. Veroyatnost. i Primenen. 35(4), 655 (1990).

    MathSciNet  Google Scholar 

  14. B. S. Darkhovskii, Teor. Veroyatnost. i Primenen. 40(4), 898 (1995).

    MathSciNet  Google Scholar 

  15. F. Gini, A. Farina, and M. Greco, IEEE Trans. Aerospace Electron. Systems 37(1), 329 (2001).

    Article  Google Scholar 

  16. A. V. Kel’manov and L. V. Mikhailova, Zh. Vychisl. Mat. Mat. Fiz. 46(1), 172 (2006).

    MATH  MathSciNet  Google Scholar 

  17. A. V. Kel’manov and S. A. Khamidullin, Zh. Vychisl. Mat. Mat. Fiz. 41(5), 807 (2001).

    MathSciNet  Google Scholar 

  18. A. V. Kel’manov, S. A. Khamidullin, and L. V. Okol’nishnikova, Pattern Recognit. Image Anal. 12(4), 438 (2002).

    MathSciNet  Google Scholar 

  19. E. Kh. Gimadi, A. V. Kel’manov, M. A. Kel’manova, and S. A. Khamidullin, Sib. Zh. Ind. Mat. 9(1), 55 (2006).

    MathSciNet  Google Scholar 

  20. A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, and A. V. Pyatkin, Diskretn. Anal. Issled. Oper. Ser. 2, 14(1), 32 (2007).

    MathSciNet  Google Scholar 

  21. A. V. Kel’manov, in Mathematical Methods of Pattern Recognition. Proc. 13th All-Russia Conf. (MAKS, Moscow, 2007), pp. 261–264 [in Russian].

    Google Scholar 

  22. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Division of the Russian Academy of Sciences, pr. Koptyuga 4, Novosibirsk, 630090, Russia

    A. V. Kel’manov

Authors
  1. A. V. Kel’manov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © A.V. Kel’manov, 2008, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2008, Vol. 14, No. 2.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kel’manov, A.V. Off-line detection of a quasi-periodically recurring fragment in a numerical sequence. Proc. Steklov Inst. Math. 263 (Suppl 2), 84–92 (2008). https://doi.org/10.1134/S0081543808060096

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543808060096

Keywords

Search

Navigation