A study on efficiency of algorithms for calculating the flows bounded by moving solids and free surfaces implemented in FlowVision on distributed memory computers" . ... A general method for tracking the moving boundaries on the basis of Euler computational grids is implemented in FlowVision CFD software. ... The scalability of the proposed algorithms is studied for the problem of surfacing a submarine. The results demonstrate a high parallel efficiency of the algorithms implemented in FlowVision. ...

Еще в разделе: (Показать все результаты (>379) - num-meth.srcc.msu.ru/ )

• "An algorithm for detection of intersections between polygonal objects by
• "A parallel implementation of the subgradient algorithm for maximizing the

Электронная библиотека Попечительского совета . ... Zhang G. - A 17/10-approximation algorithm for k -bounded space on-line variable-sized bin packing . ... Название: A 17/10-approximation algorithm for k -bounded space on-line variable-sized bin packing . Автор: Zhang G. Язык: . ... Электронная библиотека попечительского совета мехмата МГУ , 2004-2016 . ...

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

• Bradley G.H. - Algorithm and Bound for the Greatest Common Divisor of n
• Walkowiak K.M. - A Branch and Bound Algorithm for Primary Routes Assignment in
• Dorndorf U., Pesch Е., Phan-Huv Т. - A branch-and-bound algorithm for the

... graph . ... lib::graph -- improvement of code and fix of bug in add_node function . ... 15 lines -- {line: cost}. 16 line is frozenset([e1, e2]) . ... 20 >>> g.fast_cliques() . ... 33 def __init__ ( self , nodes = None , lines = None ): . ... 48 def count_one ( self , node ): . ... 56 c = dict ([( node , 0 ) for node in self . ... 63 def drop_node ( self , node ): . ... 68 def add_node ( self , node , parent_graph ): . ... 75 def drop_nodes ( self , nodes ): . ... add_node ( node , self ) . ...

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

• allpy: 223df1ee4c21 allpy/graph.py
• allpy: 0ef1a722b738 lib/graph.py
• allpy: 578bc81d5e62 allpy/graph.py

Next: About this document Up: Recommended reading Previous: I. Daubechies1992, . For a learn-from-the-practitioners approach, the reader might consult recent literature in his or her own field. Databases such as ISI Science Citations show over a hundred articles annually, and any recommendation we would make is bound to be obsolete by the time this pamphlet reaches the reader. ... Finally, as for many things, learn-by-doing may be the best approach. ... Mon Nov 13 10:51:25 EST 1995 ...

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

PPBB Library . The Portable Parallel Branch-and-Bound Library ( PPBB-Library ) presents an easy way to parallelize sequential Branch-and-Bound algorithms for several architectures. ... On the first hand the library can be used for the automatic parallelization of sequential Branch-and-Bound algorithms. ... Home Site: . http://www.uni-paderborn.de/~ppbb-lib/ . ... Yes (request through Home Site) . ... None . ... SAL Home | Parallel Computing | Tools & Utilities . ...

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

• SAL- Numerical Analysis - Optimization - L-BFGS-B
• SAL- Numerical Analysis - Optimization - PPBB
• SAL- Numerical Analysis - Optimization - bob++

... Е. з. бДпДкъЦЗ м~ВћМњИ ^ВМЪ йћВЛМВММУ,,У ЛМТЪЛЪЫЪ flВ Мњi ЛТТОВУ,МЛИ, СЫћМ еУТНУ,ТНУИ УћО. ї бi еВ, Е.з., 1996 ( ), . ... бДпДкъЦЗ Е.з. зйЗДь ланмДсаь З дЗДзнйЗйв еЦпДзадЦ 81 ). .. , . ... V = const sin(kx) ( cos(kx), exp(ikx), exp(- ikx)), k = E - V . V. , , , = 0 = a ( , 82 лйкйлйЗлдав йЕкДбйЗДнЦгъзхв ЬмкзДг, <7, 1996 ). , , , ( ). sin(nx) c : n = 1, 2, 3, ... , = 1, 4, 9, ... (. . ... 4. (, ) ( ). 86 лйкйлйЗлдав йЕкДбйЗДнЦгъзхв ЬмкзДг, <7, 1996 зЦгазЦвзхЦ мкДЗзЦзаь , V(x) S(E ) , , , . ...

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

BILLIARD WALK ­ NEW SAMPLING ALGORITHM Gryazina E. 1, Polyak B. 1 Institute for Control Sciences RAS, 65, Profsoyuznaya st., Moscow, 117997, Russia, +7 (495) 334 7641, gryazina@gmail.com Generating points uniformly distributed in an arbitrary bounded (measurable) region QR (sampling) finds applications in many computational problems. ... The other sampling procedures use modern versions of Monte Carlo technique, based on Markov Chain Monte Carlo (MCMC) approach [1]. ... Algorithm of Billiard Walk 1. ...

Еще в разделе: (Показать все результаты (>85) - www.mce.biophys.msu.ru/ )

• http://www.mce.biophys.msu.ru/archive/doc61585/eng.pdf

... Mathematical models and methods in VLSI design . ... General models and statements about the complexity of combinatorial tasks, methods for development of fast algorithms (method of dynamic programming, ?divide and conquer?, ?method of model extension?) are considered. ... Mathematical models of contemporary electronic circuits are considered and basic approaches to solving task of logic synthesis, as well as tasks of VLSI modules placement and interconnection routing are described. ...

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

... Non-Uniform Retarded Time Grid Algorithms for the KZK Nonlinear Parabolic Wave Equation . ... Am., 97, 906-917 (1995)] discuss a FDTD implementation of the KZK equation on a uniform retarded time grid for cylindrically symmetric sources. The implementation of a non-uniform retarded time grid over the conventional uniform retarded time grid will be discussed. The non-uniform time grid provides a significant reduction in memory requirements and leads to substantial reduction in computation time. ...

Еще в разделе: (Показать все результаты (>34) - acs366.phys.msu.su/ )

... Two algorithms: the principal component's method (MPC) and median polishing (Median) are applied for that [2-3] . The algorithm of median polishing was offered by John W. Tukey (1981), and was applied after modification by E.V.Pervago for processing of Resistivity Imaging or Total Electrical Sounding (TES) data. ... To this table we apply algorithm of median polishing, but in addition to rows and columns we shall also include in processing inclined lines, corresponding to C-effect. ...

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

Выберите категорию обращения: Общие вопросы Отчеты Рейтинги Диссертационные советы Конкурсы Ввод данных Структура организаций Пользователи Проблемы с регистрацией\входом в систему . ... Войти в систему . ... Авторы: Yagola A.G. , Zhang Y. , Lukyanenko D.V. Международная научная конференция ?Методы создания, исследования и идентификации математических моделей?, посвященная 85-летию со дня рождения Анатолия Семеновича Алексеева, Новосибирск, Академгородок, 10-13 октября 2013 года , Новосибирск, 2013 . ...

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

• Random Structures and Algorithms - журнал | ИСТИНА - Интеллектуальная Система
• Journal of Algorithms - журнал | ИСТИНА - Интеллектуальная Система
• Journal of Discrete Algorithms - журнал | ИСТИНА - Интеллектуальная Система

... The suggested algorithm tries to solve the problem of the detection of hydrophobic clusters corresponding to spatial areas occupied exclusively or mainly by non-polar groups of atoms, in a given 3D structure of protein or macromolecular complex. ... The vertices of each connected component that contains not less than m non-polar groups form a hydrophobic cluster. ... The found hydrophobic clusters, ordered in accordance to the number of non-polar groups, form the output of the algorithm. ... PHE . ...

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

• Inquiry information || Parsimony algorithm
• SDP home page

... Laboratory of Mathematical Methods of Image Processing . ... Rank image filtering . ... Rank algorithms are well-known approach to image enhancement, denoising, and some other applications. ... On the other hand, there are known fast median filtering algorithms. ... Fast rank algorithms in use, image size 250x250 pixels: . ... Image with added Gaussian noise . ... Fast Rank Algorithms Based on Multiscale Histograms and Lazy Calculations // Pattern Recognition and Image Analysis , Vol. ...

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

• Research | Laboratory of Mathematical Methods of Image Processing
• View publication | Laboratory of Mathematical Methods of Image Processing

Internet Engineering Task Force (IETF) A. Bryan Request for Comments: 5843 April 2010 Category: Informational ISSN: 2070-1721 Additional Hash Algorithms for HTTP Instance Digests Abstract The IANA registry named "Hypertext Transfer Protocol (HTTP) Digest Algorithm Values" defines values for digest algorithms used by Instance Digests in HTTP. ... Bryan Informational [Page 2] RFC 5843 More Algorithms for HTTP Instance Digests April 2010 Reference: [RFC1321], [RFC4648], this document. ...

Еще в разделе: (Показать все результаты (>10904) - mirror.msu.net/ )

• http://mirror.msu.net/pub/rfc-editor/rfc-ed-all/pdfrfc/rfc5843.txt.pdf
• Index of /pub/gentoo-portage/dev-haskell/vector-algorithms/
• Index of /pub/gentoo-portage/dev-perl/Algorithm-C3/

... This applet generates an observing list based on an observer's location and time. ... To use this program, enter in your location, and the local times at which you wish to begin and end observing. The date you enter should correspond to the calendar day at the time at which you begin observing. For example, if you wish to observe from 9:37 PM October 23, 2007 until 3:21 AM October 24, 2007, you would enter 21:37 for the starting time, 03:21 for the finish time, and 10/23/2007 for the date. ...

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

... About lab . ... Online Journal "Computer graphics and multimedia" (in russian) . ... Algorithms for calculating parameters of virtual scenes in computer vision tasks . ...

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

• Generic regularization of boosting-based algorithms for the discovery of
• High-Quality Algorithm for Bayer Pattern Interpolation | Graphics and Media Lab
• An Improved Demosaicing Algorithm | Graphics and Media Lab

... Algorithm & . Format requirements . ... SDPsite is a tool for identification of protein active and other functional sites, based on spatial clustering of SDPs (specificity-determining positions, described here ) with CPs (conserved positions). ... Mapping predictied positions onto structure and construction of the best cluster . ... The input data of the algorithm are a multiple protein alignment divided into specificity groups . ... is called statistical significance of the set of k* positions . ...

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

• Algorithm
• RNA Alignment
• SDPlight

. PHP Manual . Prev . Next . (PHP 4 >= 4.0.2) mcrypt_enc_get_algorithms_name -- Returns the name of the opened algorithm . string mcrypt_enc_get_algorithms_name ( resource td) . This function returns the name of the algorithm. Prev . Home . Next . mcrypt_enc_get_iv_size . Up . mcrypt_enc_get_modes_name

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

• mcrypt_module_is_block_algorithm_mode
• mcrypt_enc_is_block_algorithm_mode
• mcrypt_list_algorithms

The Chair of Mathematical Theory of Intelligent Systems and . ... Staff . ... Gasanov Elyar Eldarovich was born on November 14, 1959, in Moscow. ... In Moscow State University, E.E. Gasanov lectures the special courses "Theory of intelligent systems", "Theory of databases and information retrieval", "Additional chapters of discrete mathematics and mathematical cybernetics" and holds a special seminar in problems of complexity of search algorithms. ... Gasanov E.E. Instantly solvable search problems. ...

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

• Intelligent Systems :: Research :: :: Articles
• Интеллектуальные системы :: Сотрудники :: Гасанов Эльяр Эльдарович :: Instantly

The Length of Joins in Lambek Calculus / Sorokin A.A. // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. ...

Еще в разделе: (Показать все результаты (>86) - vestnik.math.msu.su/ )