Skip to main content
SpringerLink
Log in

Modifying the tolerant substitution method in almost uniform compact surveys

  • Safety, Persistence, Reliability, Technical Diagnostics
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We consider an improvement of the tolerant substitutions method that lets it be efficiently used for every almost uniform questionnaire. The algorithm is based on the notion of a temporal structure and generating a route for every fundamental structure in the tolerance graph.

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. Parkhomenko, P.P. and Sogomonyan, E.S., Osnovy tekhnicheskoi diagnostiki (Fundamentals of Technical Diagnostics), Moscow: Nauka, 1981, vol. 2.

    Google Scholar 

  2. Parkhomenko, P.P., Theory of Questionnaires (Review), Autom. Remote Control, 1970, vol. 31, no. 4, pp. 639–655.

    MathSciNet  Google Scholar 

  3. Parkhomenko, P.P., Questionnaires and Organizational Hierarchies, Autom. Remote Control, 2010, vol. 71, no. 6, pp. 1124–1134.

    Article  MathSciNet  MATH  Google Scholar 

  4. Arzhenenko, A.Yu. and Chugaev, B.N., Optimal’nye binarnye voprosniki (Optimal Binary Questionnaires), Moscow: Energoatomizdat, 1989.

    Google Scholar 

  5. Arzhenenko, A.Yu. and Chugaev, B.N., Matematicheskie osnovy tekhnicheskoi diagnostiki (Mathematical Fundamentals of Technical Diagnostics), Moscow: Mosk. Aviats. Inst., 1994.

    Google Scholar 

  6. Arzhenenko, A.Yu. and Bondarenko, A.B., Optimizing Binary Questionnaires with the Tolerant Substitution Method, Elektron. Modelir., 1990, vol. 12, no. 3, pp. 53–57.

    Google Scholar 

  7. Arzhenenko, A.Yu. and Bondarenko, A.B., Optimal Desing Algorithm for an Irredundant Compact Questionnaire, Autom. Remote Control, 1991, vol. 52, no. 5, part 2, pp. 726–731.

    MATH  Google Scholar 

  8. Arzhenenko, A.Yu. and Bondarenko, A.B., Problemy diskretnogo poiska (Discrete Search Problems), Moscow: Univ. Ross. Akad. Obrazovan., 2003.

    Google Scholar 

  9. Ahlswede, R. and Wegener, I., Suchprobleme, Stuttgart: Teubner, 1979. Translated under the title Zadachi poiska, Moscow: Mir, 1982.

    MATH  Google Scholar 

  10. Volkov, P.A., A Necessary and Sufficient Condition for the Existence of Canonical and Special Cases for Early Identification Pairs in Binary Questionnaires, Tr. Mezhd. konf. “Informatsionnye tekhnologii v obrazovanii, nauke i proizvodstve” (Proc. Int. Conf. “Information Technologies in Education, Science, and Industry”), Serpukhov: Komitet po Obrazovaniyu, 2009, vol. 2.

    Google Scholar 

  11. Parkhomenko, P.P., Classification of the Hamiltonian Cycles in Binary Hypercubes, Autom. Remote Control, vol. 62, no. 6, 2001, pp. 978–991.

    Article  MathSciNet  MATH  Google Scholar 

  12. Bondarenko, A.B., Problemy razrabotki tolerantnykh perestanovok v binarnykh voprosnikakh (Problems of Developing Tolerant Substitutions in Binary Questionnaires), Available from VINITI, 2003, Moscow, no. 510B-2003.

Download references

Author information

Authors and Affiliations

  1. Moscow Aviation Institute, Moscow, Russia

    A. Yu. Arzhenenko & V. A. Vestyak

Authors
  1. A. Yu. Arzhenenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Vestyak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © A.Yu. Arzhenenko, V.A. Vestyak, 2012, published in Avtomatika i Telemekhanika, 2012, No. 7, pp. 109–118.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arzhenenko, A.Y., Vestyak, V.A. Modifying the tolerant substitution method in almost uniform compact surveys. Autom Remote Control 73, 1195–1201 (2012). https://doi.org/10.1134/S0005117912070090

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation