Intel Thread Checker 2- pozdneev@gmail.com . Intel Thread Checker 14 2008 1 / 26 1 Intel Thread Checker 1: Intel Thread Checker 2: Intel Thread Checker 14 2008 2 / 26 2 3 4 5 6 7 ( ) Microsoft Windows Intel Thread Checker / «» (Intel Software Development Tools Intel(R) Thread Checker x.x) icl ( Intel Software Development Tools Intel C++ Compiler xx.x.xxx C++ Build Environment for applications running on . ... 1 |Write -> |Err|4|omp|Memory read of glb_primes_found at |"prim|"prim| ... Read |or | ...

Еще в разделе: (Показать все результаты (>3) - angel.cmc.msu.ru/ )

• http://angel.cmc.msu.ru/~ifed/teraflops/Popova_OpenMP.pdf

General Utility Lattice Program Version 4.0 Julian D. Gale Nanochemistry Research Institute, Department of Chemistry, Curtin University, P.O. Box U1987, Perth, WA 6845, Australia email: gulp@ivec.org 1 Chapter 1 Introduction & background The General Utility Lattice Program (GULP) is designed to perform a variety of tasks based on force field methods. The original code was written to facilitate the fitting of interatomic potentials to both energy surfaces and empirical data. However, it has expanded now to

Еще в разделе: (Показать все результаты (>11) - cryst.geol.msu.ru/ )

• http://cryst.geol.msu.ru/courses/aspmk/article02.pdf
• http://cryst.geol.msu.ru/en/
• http://cryst.geol.msu.ru/odss/volume.pdf

... One can compare the positions of these singularities and their corresponding singular variables in the Feynman diagrams which contribute to the signal process under consideration, and to both reducible and irreducible backgrounds. ... For a standard analysis using cuts on variables, one should cut hard against the regions of singularities in the background singular variables while keeping the regions with singularities for the signal singular variables (see e.g. [8]). ...

Еще в разделе: (Показать все результаты (>9) - top.sinp.msu.ru/ )

• http://top.sinp.msu.ru/lev/cms5.ps

Cosmic Research, Vol. 42, No. 5, 2004, pp. 435­488. Translated from Kosmicheskie Issledovaniya, Vol. 42, No. 5, 2004, pp. 453­508. Original Russian Text Copyright © 2004 by Veselovsky, Panasyuk, Avdyushin, Bazilevskaya, Belov, Bogachev, Bogod, Bogomolov, Bothmer, Boyarchuk, Vashenyuk, Vlasov, Gnezdilov, Gorgutsa, Grechnev, Denisov, Dmitriev, Dryer, Yermolaev, Eroshenko, Zherebtsov, Zhitnik, Zhukov, Zastenker, Zelenyi, Zeldovich, Ivanov-Kholodnyi, Ignat'ev, Ishkov, Kolomiytsev, Krasheninnikov, Kudela,

Еще в разделе: (Показать все результаты (>2) - solarwind.cosmos.ru/ )

• http://www.kosmofizika.ru/buri/pansyketal.pdf

Introduction to PLASMA ASTROPHYSICS (Selected 10 lectures) Boris V. Somov Astronomical Institute and Faculty of Physics Moscow State University Pushino-na-Oke, 2008 Contents Ab out These Lectures 1 Particles and Fields: Exact Self-Consistent Description 1.1 Liouville's theorem . . . . . . . . . . . . . . . . . . . 1.1.1 Continuity in phase space . . . . . . . . . 1.1.2 The character of particle interactions 1.1.3 The Lorentz force, gravity . . . . . . . . . 1.1.4 Collisional friction . . . . . . . . . . . .

Еще в разделе: (Показать все результаты (>2) - sun.sai.msu.ru/ )

• Solar Physics Department

The beamer class Manual for version 3.06. \begin{frame} \frametitle{There Is No Largest Prime Number} \framesubtitle{The proof uses \textit{reductio ad absurdum}.} \begin{theorem} There is no largest prime number. \end{theorem} \begin{proof} \begin{enumerate} \item<1-| alert@1> Suppose $p$ were the largest prime number. \item<2-> Let $q$ be the product of the first $p$ numbers. \item<3-> Then $q+1$ is not divisible by any of them. \item<1-> Thus $q+1$ is also prime and greater than $p$.\qedhere

196. CURRICULUM VITAE

197. http://cosrad.sinp.msu.ru/experiments/tus/doc/Ponce2007fin.pdf

198. CV of Alexander Moskovsky

199. Alexander B. Kurzhanski (Kurzhanskiy) | Кафедра системного анализа ВМК МГУ

200. http://tunka.sinp.msu.ru/en/presentation/Sveshnikova.pdf