Discrete-mathematical approach to formal description of measurement procedure

Measurement: Journal of the International Measurement Confederation

Volumn 18, Issue 2, 1996, Pages 71-80

  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; Search methods

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; NUMERICAL METHODS; OPTIMIZATION; SET THEORY;

DISCRETE MATHEMATICAL APPROACH; FORMAL DESCRIPTION; MEASUREMENT INFORMATION SYSTEM; MEASUREMENT PROCEDURE; SEARCH METHODS;

MEASUREMENT THEORY;

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

References (16)

1. L. Finkelstein, Measurement, information, knowledge-fundamental concepts, philosophical implications, applications, Proc. of the XIII IMEKO World Congress, Turin, Italy (5-9 September 1994), 1, pp. 11-18
2. P.H. Sydenham, Disciplined design of sensor systems -Parts 1 and 2, Measurement 14(1) (1994) 73-87.
3. S.V. Muravyov and V. Savolainen, Development particularities for programming systems of measurement procedures, IEEE Trans. on Instrumentation and Measurement 42(5) (October 1993) 906-912.
4. S.V. Muravyov, Metis: Integrated environment of measurement programming. Proc. of the XIII IMEKO World Congress, Turin, Italy (5-9 September 1994) 3, pp. 2284-2288.
5. S.V. Muravyov and V.N. Borikov, Algorithms of discrete mathematics in measurement, Izmerenija, Kontrol, Avtomatizatsija 1-2 (1992) 20-28 (in Russian).
6. S.V. Muravyov and V. Savolainen, Computer-aided measurement systems as information systems: discrete-mathematical foundations. Working paper WP-30, University of Jyväskylä, Jyväskylä, Finland, 1994, p. 28.
7. J. Pfanzagl, Theory of Measurement, John Wiley & Sons, New York, 1968.
8. E.M. Reingold, J. Nivergelt and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, 1977.
9. O. Ore, Graphs and Their Uses, Random House, New York, 1963.
10. N. Wirth, Algorithms and Data Structure, Prentice-Hall, Englewood Cliffs, 1986.
11. F.F. Mazda, Electronic Instruments and Measurement Techniques, Cambridge University Press, Cambridge, 1987.
12. J.F. Traub, G.W. Wasilkowski and H. Wozniakowski, Information, Uncertainty, Complexity, Addison-Wesley, Reading, 1983.
13. J.G. Kemeny and J.L. Snell, Mathematical Models in the Social Sciences, Waltham, Mass & London, 1962.
14. K.P. Bogart, Preference structure I: Distances between transitive preference relations, J. of Math. Sociology 4 (1973).
15. B.G. Litvak, Expert Information: Methods for Obtaining and Analysis, Radio i svjaz, Moscow, 1982 (in Russian).
16. 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.