ABOUT THE EXPERIENCE OF REALIZATION OF THE UNIVERSITY INFORMATION TECHNOLOGY CLASSES
Journal Title: Современные информационные технологии и ИТ-образование - Year 2017, Vol 13, Issue 2
Abstract
The article gives a brief description of the methods and forms of implementation, as well as models of university profile classes. The experience of the Orenburg State University on the implementation of university information technology classes has been considered in detail. It is shown that university information technology classes can be an element of the system of early detection, aid and support of highly motivated and talented students based on the profile of competencies and personal development trajectory necessary in the digital economy of Russia.
Authors and Affiliations
Tatiana Petukhova, Irina Minina
TIME EFFICIENT ALGORITHM FOR THE GENERALIZED0 ENTROPYCALCULATION OF TWO-DIMENSIONS WORDS BY THE METHOD OF A SLIDING WINDOW
In the article we consider methods for calculating the entropy of two-dimensional words of finite length over in finite alphabet, with reference to the problem of self-organization of rod-like particles on a torus. Monit...
MODIFICATION OF THE ANT COLONY OPTIMIZATION FOR THE DEVELOPMENT OF SOFTWARE FOR SOLVING MULTI-CRITERION SUPPLY MANAGEMENT PROBLEMS
The article proposes three modifications of the Ant Colony Optimization, for finding multi-criterion solutions for the task of supplying spare parts for aviation equipment. A peculiarity of modifications is the weights m...
ON REGULARIZATION OF INVERSE PROBLEM FOR HEAT EQUATION
The paper contains new results on spectral methods for solving ill-posed problems using the example of the Cauchy problem for a parabolic equation. A method for regularizing the solution of the inverse problem is propose...
THE ESTIMATIONS OF THE PARAMETERS OF THE DISTRIBUTION OF THE LOGARITHM OF THE COMPLEXITY OF TSP
The complexity of the individual traveling salesman problem was analyzed by means of mathematical statistics. The complexity is defined as a number of nodes of the decision tree created by the branch and bound algorithm....
FEASIBILITY OF USING METHODS OF ALMOST PERIODIC FUNCTIONS, WAVELET ANALYSIS AND HURST SELF-SIMILARITY FOR PREDICTING NEWS EVENTS IN THE INFORMATION SPACE
In the present paper we consider the feasibility of using methods of almost periodic functions, wavelet analysis and Hurst self-similarity to analyze in length of time the behavior spectra of vectors defining the positio...