Domnikov

pp. 215-227

This paper considers the problem of appropriate orderliness of the electronic course modules. To solve this problem, we use the information that is specified by the structure of expert preferences or hypertext structure using a set of modules. For expert structure processing the theory of binary relations is applied. We propose a mathematical model to process the strongly linked fragments of expert structure. This model is based on a partition of a set of modules into tolerance classes. The task of searching an ordinal approximation of the hypertext structure is reduced to a problem of the least coverage matrix.

In 2012 at MSAL named after Kutafin a scientific research was carried out; the aim of the research was to determine prospects for further development of the University’s knowledge management system. In recent years many researchers paid significant attention to development of this branch of IT penetration into the field of education. After analyzing the existent experience, a group of authors defined a check list of the most promising and successful projects which had been implemented, in a varying degree, with the use of knowledge management systems. The authors made special reference to the system for generating educational content developed at Bauman MSTU under the auspices of prof. I.P. Norenkov. This particular direction that allows to increase efficiency of development and actualization of electronic educational resources, in the future, will help to create unified subject areas in universities, which, in their turn, will clear the way to new learning technologies based on project and cross-disciplinary forms of the teaching process. This article describes problems of electronic educational resources in the university and approaches to their solving. A set of scenarios of formation, visualization and application of knowledge bases was also considered.

Connection of two tables in parallel database system (PDBS) was analyzed in this article. The Laplace–Stieltjes transform (LST) of connection time of two tables with NLJ and HJ methods in PDBS was introduced. Random character of the number of rows in the connecting tables is considered along with node fragmentation of tables, filtration of all table entries, probability of matching of connection attribute values, variants of hash-table location in the memory and parameters of interprocessor communication of PDBS nodes. Generating function of resultant value of entries, obtained after connection of tables in any node is presented in the article.

The paper presents the general questions connected with a test quality monitoring of quality of training, and also various ways of classification of tests and test tasks. We present the review of the basic criteria for estimation of tests reliability, validity, difficulty and so on. A number of the validity measures of tests is offered. These measures are based on the knowledge of a subject domain of studied discipline in the form of a semantic network.