Abstract: It is shown that trust in the content of information resources can be assessed by means of a publishing criterion, with the information recourses being of the trusted and distrusted type. The task of assessment of trust consists of four subtasks: (1) building multisets of physical quantities available in primary data sources, (2) alignment of values of physical quantities, (3) formulation of quantitative restrictions for publishing criterion in different ranges of change of physical quantities, and (4) decomposition of expert data. Spectral data publishing criteria and restrictions required for solving data alignment tasks are outlined. Alignment results have been tabulated. Using vacuum wavenumbers as an example, restrictions inherent in publishing criteria are formulated. The assessment of the content trust obtained from solutions to the tasks of decomposition f expert data are presented as the OWL-ontologies. Building knowledge bases of this kind at virtual data centers intended for data intensive science will provide realization of an automatic selection of spectroscopic information resources exhibiting a high degree of trust.

Abstract: The report is devoted to the analysis of the method of comparison of programming languages, convenient for assessing the expressive power of languages and the complexity of the programming systems. The method is adapted to substantiate practical, objective criteria of program decomposition, which can be considered as an approach to solving the problem of factorization of very complicated definitions of programming languages and their support systems. The article presents the results of the analysis of the most well-known programming paradigms and outlines an approach to navigation in the modern expanding space of programming languages, based on the classification of paradigms on the peculiarities of problem statements and semantic characteristics of programming languages and systems with an emphasis on the criteria for the quality of programs and priorities in decision-making in their implementation.

Abstract: The purpose of the article is the choice of presenting the results of a comparison of programming languages, convenient for assessing the expressive power of languages and the complexity of the implementation of programming systems. Forms of such a presentation should be adapted to substantiate practical criteria for program decomposition, which can be viewed as an approach to solving the problem of factorization of very sophisticated definitions of programming languages.
The relevance of choosing concise and quickly perceived forms is useful for working in the rapidly developing space of new problem-oriented programming languages. Along the way, you can show the distance in the conceptual complexity between programming and the development of programming systems.