?
Algorithm for foam generation in plane
Journal of Physics: Conference Series. 2021. Vol. 1740. No. 012030. P. 1-5.
Klimenkova O., Shchur L.
We propose a novel algorithm for the construction of the sparse, nonetheless, the massive and rigid structure. The generated structures possess two significant properties reminiscent of the metallic foams. Firstly, the weight of the structures can be as low as the percent of the bulk one. Secondly, the structures are mechanically rigid. The structures are necessary for the simulation of the physical models of the foam properties.
Trubochkina N. K., Кондратьев Н. В., Мир техники кино 2015 Т. 37 № 3 С. 6-16
A new approach in the development of three-dimensional movies without glasses, but rather, the technique of fantastic graphics and media worlds creating with the help of mathematics and computer software, as the basis for the subsequent encoding a lenticular screen, is proposed. A parametric fractals calculation model, taking into account the position of the virtual ...
Added: October 23, 2015
Mironkin V., Timokhin I., Обозрение прикладной и промышленной математики 2018 Т. 25 № 2 С. 103-112
Modes for parallelization of the process of calculating the hash code and data transfer based on l-ary trees are described. A comparative analysis of their implementations written in the Python programming language is carried out and some functional features are described. Promising directions in the field of synthesis of the tree modes of hash functions ...
Added: January 25, 2019
Богданов Д. С., Дали Ф. А., Mironkin V., Современные информационные технологии и ИТ-образование 2018 Т. 14 № 2 С. 419-425
Classical approaches to the construction of hash function modes, based on the using of iterative procedures, do not allow efficient processing of large amounts of data and can’t be adapted to parallel computing architectures. It applies to both the Russian cryptographic standard GOST R 34.11-2012, which determines the algorithm and procedure for calculating the hash ...
Added: November 8, 2018
Дали Ф. А., Mironkin V., Проблемы информационной безопасности. Компьютерные системы 2018 № 1 С. 113-121
Two models of the tree modes of hash functions are introduced. For each model algorithms of computing of the hash code are formulated and their numerical characteristics are obtained. In terms of the constructed models we classify some existing algorithms for parallel hashing and identify some weaknesses of corresponding primitives. ...
Added: May 28, 2018
Bliznets Ivan, Fomin F., Golovach P. et al., Algorithmica 2017 Vol. 79 No. 3 P. 798-813
In the Shortest Superstring problem we are given a set of strings S=\{s_1, \ldots , s_n\} and integer \ell and the question is to decide whether there is a superstring s of length at most \ellcontaining all strings of S as substrings. We obtain several parameterized algorithms and complexity results for this problem. In particular, we give an algorithm which in time 2^{\mathcal {O}(k)} {\text {poly}}(n) finds a ...
Added: October 29, 2018
Kazda A., Zhuk D., Algebra Universalis 2021 Vol. 82 Article 11
We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of dimension at most N, where the number N depends on the arities of basic ...
Added: February 5, 2021
Yakovlev E., Известия высших учебных заведений. Поволжский регион. Физико-математические науки 2022 № 3 С. 3-10
Background. The objects of study are triangulated compact polyhedron P , which are n -dimensional manifolds with boundary. The goal is to create new efficient algorithms for calculating modulo 2 intersection indices. Materials and methods. The construction of a closed n-dimensional path along a given absolute one-dimensional cycle is
used. Results. An algorithm has been developed to calculate the ...
Added: October 24, 2022
Анисимов В. Г., Анисимов Е. Г., Гарькушев А. Ю. et al., Известия Российской академии ракетных и артиллерийских наук 2015 № 4 С. 34-39
Article considers the solution of a problem of formation of the optimum plan of performance of a complex of the interconnected actions in interests of preparation of space systems. The offered model considers limitation, a variety, interchangeability, productivity and cost of renewable resources (performers) involved in the course of preparation. It provides minimization of time ...
Added: February 28, 2016
Aleskerov F. T., Vyacheslav V. Chistyakov, Procedia Computer Science 2013 Vol. 17 P. 1103-1106
The problem of axiomatic and algorithmic constructions of the threshold decision making is studied in the case when individual opinions are given as m-graded strict preferences (with m ≥ 3). It is shown that the only rule satisfying the introduced axioms is the threshold rule. Two explicit algorithms are presented: the ordering algorithm, under which ...
Added: August 29, 2013
Голяев Ю. Д., Житенев О. С., Иванов М. А. et al., Качество. Инновации. Образование 2015 № 10 С. 39-53
Development of software for inertial measurement unit on the Zeeman laser gyros operating in quasifourmode regime and on quartz accelerometers is considered. The mathematical algorithms that provide full compensation both magnetic and non-magnetic components of the laser gyro drift, and algorithms for accelerometers error compensation with periodic calibration of the ADC are described. ...
Added: January 25, 2016
Domoratsky E., Информационные технологии 2016 Т. 22 № 8 С. 605-609
Рассмотрен алгоритм синтеза геометрических характеристик одномерных и двумерных проекционных изображений выпуклых трехмерных объектов неправильной формы, аппроксимируемых эллипсоидом общего вида. Алгоритм содержит математические модели последовательности операций (процедур) получения проекционных изображений, их морфологического анализа (получения базовых геометрических признаков) и получения численных значений пространственных геометрических характеристик проекционных изображений. ...
Added: October 16, 2017
Pablo San Segundo ., Alvaro Lopez ., Mikhail Batsyn, Lecture Notes in Computer Science 2014 Vol. 8426 No. DOI 10.1007/978-3-319-09584-4_12 P. 111-120
In recent years there have been a number of important improvements in exact color-based maximum clique solvers, which have considerably enhanced their performance. Initial vertex ordering is one strategy known to have a significant impact on the size of the search tree. Typically, a degenerate sorting by minimum degree is used; literature also reports different ...
Added: September 6, 2014
Vladislav E. Kruglov, Dmitry S. Malyshev, Olga V. Pochinka, / Cornell University. Series math "arxiv.org". 2017. No. 1706.01695v1.
Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads to Ω-stable flows on surfaces, which are not structurally stable. However, in the present paper we prove that a ...
Added: September 11, 2017
Sirotkin A., Информатика и автоматизация (Труды СПИИРАН) 2013 № 25 С. 204-220
The paper describe key points in algebraic bayesian network knowledge pattern implementation on C++ programming language. Knowledge pattern implemented as class that handle and store estimation for knowledge pattern elements. It also provide a couple of methods for processing knowledge pattern such as consistency update and a posteriori inference. ...
Added: March 24, 2014
Penzar D., Krivozubov M., Spirin S., BMC Bioinformatics 2018 Vol. 19 No. 374 P. 1-14
Background. Many algorithms and programs are available for phylogenetic reconstruction of families of proteins. Methods used widely at present use either a number of distance-based principles or character-based principles of maximum parsimony or maximum likelihood.
Results. We developed a novel program, named PQ, for reconstructing protein and nucleic acid phylogenies following a new character-based principle. Being ...
Added: October 26, 2018
Bliznets Ivan, Fomin F., Pilipczuk M. et al., Algorithmica 2016 Vol. 76 No. 2 P. 569-594
We prove that in a graph with n vertices, induced chordal and interval subgraphs with the maximum number of vertices can be found in time 2^(𝜆𝑛) for some 𝜆<1. These are the first algorithms breaking the trivial 2^𝑛 poly(n) bound of the brute-force search for these problems. ...
Added: October 26, 2018
Фотеева А. В., Феофилова А. Е., Ростова Н. Б. et al., Медико-фармацевтический журнал "Пульс" 2022 Т. 24 № 4 С. 38-43
Abstract. The modern regulatory requirements for pharmaceutical development, stricter of requirements of
medicinal products (MP) quality standards, the experience of manufacturers and development companies in terms of MP pharmaceutical development revealed need to create solutions that minimize the risk of medicinal product quality deviations, guaranteeing the release of effective and safe MP with the planned quality. The aim of these study is to ...
Added: May 13, 2022
Yakovlev E., Епифанов В. Ю., Известия высших учебных заведений. Поволжский регион. Физико-математические науки 2018 № 2(46) С. 47-55
The objects of research are two-dimensional compact polyhedra with an Euclidean cell decomposition, which are pseudomanifolds with boundary. The goal is to create new effective algorithms for computing the bases of absolute and relative homology groups modulo 2. Proposed a reduction procedure to a similar problem for polyhedra of lesser dimensionality, containing fewer number of cells. We ...
Added: October 4, 2018
Gnatenko A., Zakharov V., Proceedings of the Institute for System Programming of the RAS 2018 Vol. 30 No. 3 P. 303-324
The syntax and semantics of the new temporal logic LP-CTL * designed for the formal specification of the behavior of sequential responsive programs, modeled by automata-transducers (transducers) over semigroups, are developed. An algorithm is developed for verifying the feasibility of the formulas of the proposed temporal logic on models represented by finite transducers working on ...
Added: June 14, 2018
Vikentyeva O., Полякова О. А., Пермь : Издательство Пермского национального исследовательского политехнического университета, 2019
The tutorial deals with the application of the basic principles of structured programming in complex software systems in the high-level C ++ language, which are demonstrated with meaningful examples. ...
Added: September 16, 2020
Vikentyeva O., Deryabin A. I., Shestakova L. V., International Journal "Information Models and Analyses" 2014 Vol. 3 No. 3 P. 271-279
Changes of professional environment, caused by introduction of new technologies and techniques, create a necessity in continuous education and development of professional competences. In these conditions, managers and other company employees face the choice of methods and tools of personnel training. A business game is one of the most productive tools of business-education This paper ...
Added: August 19, 2014
Yakovlev E., Epifanov V., Lobachevskii Journal of Mathematics 2019 Vol. 40 No. 5 P. 690-698
We solve some computational problems for triangulated closed three-dimensional manifolds
using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms
for computing intersection numbers of 1- and 2-dimensional cycles are developed. Using these
algorithms it is possible to construct a basis of the cohomology group from a given basis of the
homology group of complementary dimension. ...
Added: October 8, 2019
Старичкова Ю. В., Neznanov A., Бизнес-информатика 2011 № 3 С. 36-44
Описывается оригинальный программный комплекс для генерации бесконечных и конечных семейств связных транзитивных графов степени 4, полностью покрывающих все известные графы до 30 вершин. Отличительной особенностью разработки является многокритериальная каталогизация семейств на основе характеристик симметрии, структурной сложности и визуализации симметричных диаграмм. Комплекс расширяет функциональные возможности АСНИ «Graph Model Workshop» и позволяет решать задачи, требующие синтеза транзитивных ...
Added: September 11, 2012
Malyshev D., Alekseev V., Дискретный анализ и исследование операций 2008 Т. 15 № 1 С. 3-10
Доказывается полиномиальная разрешимость задачи о независимом множестве для бесконечного семейства подмножеств класса планарных графов. ...
Added: August 31, 2012