Book
Страницы истории отечественных ИТ
Т. 1. М.: Альпина Паблишерз, 2015.
Compiler:
Э. М. Пройдаков
Chapters
Шилов В. В. В кн.: Страницы истории отечественных ИТ. Т. 1. М.: Альпина Паблишерз, 2015. Гл. 14. С. 73-81.
Biography and analysis of scientific activity one of the pioneers of Soviet computer science, - Anatoly Ivanovich Kitov.
Added: Mar 15, 2016
Language:
Russian
Similar publications
Плаксин М. А. Современные информационные технологии и ИТ-образование. 2015. Т. 1 . № 11. С. 302-309.
Added: Nov 29, 2015
Ч. 2: Лабораторные работы 4-6. М.: РИО МИЭМ НИУ ВШЭ, 2013.
Added: Apr 5, 2013
Ч. 1: Лабораторные работы 1-3. М.: РИО МИЭМ НИУ ВШЭ, 2013.
Added: Apr 5, 2013
Борина Г. Б. Информатика и образование. 2012. № 5. С. 61-64.
In the article methodical aspects and technology of the organization of project work of students within the limits of one of monitoring elements - homework are considered. Work on the project forms skills of work with ICT, necessary for practical use at the subsequent grade levels, at performance of term papers and at the decision of typical problems in a professional field of activity of the future specialist.
Added: Sep 6, 2012
Added: Dec 2, 2012
Зверева Т. И. Информатика и образование. 2011. № 6. С. 31-34.
Added: May 12, 2012
Ахметсафина Р. З., Максименкова О. В. В кн.: II Всероссийская научно-практическая конференция "Информационные технологии в образовании XXI века". Сборник научных трудов. Т. 2. М.: НИЯУ МИФИ, 2012. С. 60-63.
Added: Mar 14, 2013
Эвина К. Ю., Gromoff A., Kazantsev N. et al. In bk.: Mapping the global future: evolution through innovation and excellence. Fourteenth annual international conference. Reading book. NY: Global Business And Technology Association, 2012. P. 208-215.
Nowadays there is a variety of views on future business architecture. On the one hand, it’s getting more and more influenced by IT: information flows are growing rapidly and walls between the departments or even subcompanies are being erased. On the other hand, business architecture incumbents are not often ready for quick e-transformations due to their silos: inner friction, employees and “as-is” processes. This article represents courageous attempt to business architecture development burning issues made by the authors. The proposal to increase agility suggested in this research is creating real-time business architecture: validate processes using practical cases and simultaneously publish the best examples in the cloud where they could be easily achieved on demand.
Added: Dec 19, 2012
Смирнов С. Н., Захаров А. В., Рачков Р. В. и др. Финансовая инженерия, риск-менеджмент и актуарная наука. WP16. Высшая школа экономики, 2007. № WP16/2007/03.
Added: Mar 15, 2013
Podinovskiy V. V. European Journal of Operational Research. 2012. Vol. 221. No. 1. P. 198-204.
In this paper we consider choice problems under the assumption that the preferences of the decision maker are expressed in the form of a parametric partial weak order without assuming the existence of any value function. We investigate both the sensitivity (stability) of each non-dominated solution with respect to the changes of parameters of this order, and the sensitivity of the set of non-dominated solutions as a whole to similar changes. We show that this type of sensitivity analysis can be performed by employing techniques of linear programming.
Added: May 21, 2012
Bauwens B., Makhlin A., Vereshchagin N. et al. Electronic Colloquium on Computational Complexity. Technical report. Hasso-Plattner-Institut, 2013. No. TR13-007.
Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any universal machine, it is possible to compute in polynomial time on input $x$ a list of polynomial size guaranteed to contain a $O(\log |x|)$-short program for $x$. We also show that there exist computable functions that map every $x$ to a list of size $O(|x|^2)$ containing a $O(1)$-short program for $x$ and this is essentially optimal because we prove that such a list must have size $\Omega(|x|^2)$. Finally we show that for some machines, computable lists containing a shortest program must have length $\Omega(2^{|x|})$.
Added: Dec 14, 2013
Малышев Д. С. Вестник Нижегородского университета им. Н.И. Лобачевского. 2012. № 2. С. 149-151.
Added: Apr 25, 2012
Belkovich R. Law. LAW. Высшая школа экономики, 2013
The emergence of the Tea Party movement in recent years has shown that under the surface of mainstream political life in the USA there exists a different layer of ideas, which cannot be satisfactorily described in terms of the Republican/Democrat dichotomy. These ideas have their origins in the foundation of the American Republic, which owes a lot to ancient and mediaeval political theory. In the twentieth century there was a revival of these ideas in the form of the so-called “paleoconservative” movements which rediscovered their ancient and mediaeval heritage. This paper focuses on one of them, the Southern Agrarian movement, as exemplary of this radical intellectual project.
Added: May 14, 2013
М.: МИЭМ, 2011.
Added: Apr 12, 2012
Соколова А. Г. М.: Издательство ИНЭП, 1998.
Added: Jan 25, 2013
Черников Б. В., Ильин В. В. М.: Издательский дом «Форум», 2010.
Added: Nov 29, 2012
Ч. 1. М.: Энергоатомиздат, 2011.
Added: Feb 7, 2013
Аксенов С. А., Чумаченко Е. Н., Сырчина О. О. Вестник Воронежского государственного технического университета. 2011. Т. 7. № 11.2. С. 62-64.
Added: Apr 12, 2012
Парусникова А. В., Брюно А. Д. Институт прикладной математики им. М.В. Келдыша Российской академии наук, 2010. № 39.
Added: Apr 18, 2012
Deviatov R. arxiv.org. math. Cornell University, 2010. No. arXiv:1007.1353v1.
Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov [7], we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.
Added: Jun 28, 2012
Abramov Y. V. arxiv.org. math. Cornell University, 2011. No. arXiv:1111.4974v1.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables
Added: Jun 28, 2012
Чумаченко Е. Н., Кулагин В. П., Назиров Р. Р. и др. Информатизация образования и науки. 2011. № 3 (11). С. 178-187.
One of directions of activity of the scientifically-educational centre "SPACE" created by the Moscow state institute of electronics and mathematics (technical university) and Space research institute of the Russian Academy of Sciences is discussed. The general statements of problems connected with working out of models of movement of asteroids and comets taking into account not gravitational indignations and construction of models for measurement of trajectories are considered. On a space vehicle orbit in a vicinity of libration’s points the traffic control model is discussed with application of a solar sail with operated reflective characteristics.
Added: Apr 12, 2012
Чумаченко Е. Н., Аксенов С. А., Борхсениус С. С. Вестник Воронежского государственного технического университета. 2011. Т. 7. № 11.2. С. 9-11.
Added: Apr 12, 2012