Skip to main content
SpringerLink
Log in

Efficiency of scale reduction algorithms in the measurement of normally distributed random quantities

  • General Problems of Metrology and Measurement Techniques
  • Published:
Measurement Techniques Aims and scope

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

Literature cited

  1. P. Suppes and G. Sines, in: Measurements in Psychology [Russian translation], Mir, Moscow (1967), p. 9.

    Google Scholar 

  2. G. S. Levitin et al., Izmer. Tekh., No. 8, 12 (1984).

    Google Scholar 

  3. E. S. Ventsel', Theory of Probability [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  4. D. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley (1973).

  5. D. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, 2nd Ed., Addison-Wesley (1974).

Download references

Authors
  1. G. S. Levitin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Izmeritel'naya Tekhnika, No. 11, pp. 37–38, November, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levitin, G.S. Efficiency of scale reduction algorithms in the measurement of normally distributed random quantities. Meas Tech 30, 1079–1081 (1987). https://doi.org/10.1007/BF00865062

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00865062

Keywords

Search

Navigation