Zobrazeno 1 - 10
of 20
pro vyhledávání: '"M. V. Noskov"'
Publikováno v:
Informatics and education. 37:25-33
Autor:
N. K. Knyazeva, M. V. Noskov
Publikováno v:
Informatics in school. 1:53-62
The article proposes a methodology for the formation of functional mathematical literacy of primary school students as a component of functional literacy. This methodology is based on mathematical models and their animation illustrations. Based on in
Autor:
I. M. Fedotova, M. V. Noskov
Publikováno v:
Siberian Advances in Mathematics. 31:45-52
We construct a minimal cubature formula of degree $$2 $$ for a torus in $${\mathbb R}^3 $$ .
Autor:
I. M. Fedotova, M. V. Noskov
Publikováno v:
Matematicheskie trudy. 23:177-186
Publikováno v:
Informatics and education. :46-54
The article discusses the conditions for the use of computerized dynamic adaptive tests to provide developing training and monitoring in the field of foreign language education. Dynamic adaptive test simulators used as a tool for personalizing and mo
Publikováno v:
Informatics and education. :29-35
The problem and the goal.The urgency of the problem of mathematical description of dynamic adaptive testing is due to the need to diagnose the cognitive abilities of students for independent learning activities. The goal of the article is to develop
Publikováno v:
Informatics and education. :4-11
The article proposes a model for forecasting the success of student’s learning. The model is a Markov process with continuous time, such as the process of “death and reproduction”. As the parameters of the process, the intensities of the proces
Autor:
M. V. Noskov, V. S. Tutatchikov
Publikováno v:
Pattern Recognition and Image Analysis. 27:110-113
Two-dimensional fast Fourier transform (FFT) for image processing and filtering is widely used in modern digital image processing systems. This paper concerns the possibility of using a modification of two-dimensional FFT with an analog of the Cooley
Publikováno v:
Journal of Siberian Federal University. Engineering & Technologies. 9:1012-1018
Autor:
M. V. Noskov, V. S. Tutatchikov
Publikováno v:
Pattern Recognition and Image Analysis. 25:81-83
One-dimensional fast Fourier transform (FFT) is the most popular tool for computing the two-dimensional Fourier transform. As a rule, a standard method of combination of one-dimensional FFTs--the so-called algorithm "by rows and columns" [1]--is used