Some structural properties of a formal model of measurement procedure

Measurement: Journal of the International Measurement Confederation

Volumn 18, Issue 2, 1996, Pages 81-87

  Muravyov, S V ^a   Savolainen, V ^b  

^a NATIONAL RESEARCH TOMSK POLYTECHNIC UNIVERSITY   (Russian Federation)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

Discrete mathematical model; Measurement procedure; Measurement theory

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; NUMERICAL METHODS; OPTIMIZATION; SET THEORY;

MEASUREMENT PROCEDURE; MULTICYCLIC STRUCTURE; ONE CYCLIC STRUCTURE;

MEASUREMENT THEORY;

EID: 0030157105     PISSN: 02632241     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0263-2241(96)00038-3     Document Type: Article

References (9)

1. S.V. Muravyov and V. Savolainen, Discrete-mathematical approach to formal description of measurement procedure, Measurement 18 (1996) 71-80.
2. M.P. Tsapenko, Measurement Information Systems, Energoatomizdat, Moscow, 1985.
3. L. Finkelstein and K.T.V. Grattan (Eds.), Concise Encyclopaedia of Measurement and Instrumentation, Pergamon, Oxford, 1994.
4. V.I. Mudrov and V.L. Kushko, Methods of Measurement Obtaining: Quasi-Likelihood Estimates, Radio i svjaz, Moscow, 1983.
5. E.M. Reingold, J. Nivergelt and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, 1977.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco, 1979.
7. C.H. Papadimitriu and K. Steiglits, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, 1982.
8. N. Christofides, Graph Theory: An Algorithmic Approach, New York & London, 1975.
9. R.L. Rivest, A.R. Meyer, D.J. Kleitman and K. Winklmann, Coping with errors in binary search procedures, J. Computer System Sci. 20 (1980) 396-404.