### ?

## 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings

Heidelberg :
Springer, 2013.

Under the general editorship: L. Cai, S. Cheng, T. Lam

In press

Baïou M., Beaudou L., Limouzy V. et al., , in : 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings. : Heidelberg: Springer, 2013. P. 196–206.

Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of these arcs. We call them facility location graphs since they arise ...

Added: April 11, 2019

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

Nesterov Y., Protasov V., SIAM Journal on Matrix Analysis and Applications 2013 Vol. 34 No. 3 P. 999–1013

We suggest a new approach to finding the maximal and the minimal spectral radii of linear operators from a given compact family of operators, which share a common invariant cone (e.g., family of nonnegative matrices). In the case of families with the so-called product structure, this leads to efficient algorithms for optimizing the spectral radius ...

Added: February 23, 2016

Protasov V., Jungers R., Linear Algebra and its Applications 2013 Vol. 438 No. 11 P. 4448–4468

We introduce a new approach to evaluate the largest Lyapunov exponent of a family of nonnegative matrices. The method is based on using special positive homogeneous functionals on , which gives iterative lower and upper bounds for the Lyapunov exponent. They improve previously known bounds and converge to the real value. The rate of convergence ...

Added: February 23, 2016

Голяев Ю. Д., Житенев О. С., Иванов М. А. 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

Springer, 2015

This proceedings set contains 85 selected full papers presentedat the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences - MCO 2015, held on May 11–13, 2015 at Lorraine University, France. The present part II of the 2 volume set includes articles devoted to Data analysis and Data mining, Heuristic ...

Added: June 1, 2015

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

Ponomarenko A., Yury M., Andrey L. et al., Business Informatics 2014

The ability to scale is desirable in computer system as well as business settings. The distributed systems clearly demonstrate this ability and powerfulness to process a very big amount of data. Many system that have distributed architecture like Hadoop file system or distributed torrent tracker are based on the distribute hash table (DHT) which manages ...

Added: October 20, 2014

Богданов Д. С., Дали Ф. А., 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

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

Basel: Birkhauser/Springer, 2015

Added: March 13, 2016

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

Дали Ф. А., 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

Klimenkova O., Shchur L., Journal of Physics: Conference Series 2021 Vol. 1740 No. 012030 P. 1–5

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 ...

Added: January 22, 2021

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

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

Centre for Language, Logic and Speech at the Tbilisi State University, 2017

The Tbilisi Symposium on Language, Logic and Computation is an interdisciplinary conference at the interface of logic, linguistics and computer science with the goal of sharing new results and developing mutually beneficial relationship between these fields. The Symposium is held biennially in different parts of Georgia. It is organized by the Institute for Logic, Language ...

Added: October 8, 2019

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

Protasov V., Guglielmi N., Foundations of Computational Mathematics 2013 Vol. 13 No. 1 P. 37–97

We address the problem of the exact computation of two joint spectral characteristics of a family of linear operators, the joint spectral radius (JSR) and the lower spectral radius (LSR), which are well-known different generalizations to a set of operators of the usual spectral radius of a linear operator. In this paper we develop a ...

Added: February 23, 2016

Protasov V., Guglielmi N., SIAM Journal on Matrix Analysis and Applications 2016 Vol. 37 No. 1 P. 18–52

We generalize the recent invariant polytope algorithm for computing the joint spectral radius and extend it to a wider class of matrix sets. This, in particular, makes the algorithm applicable to sets of matrices that have finitely many spectrum maximizing products. A criterion of convergence of the algorithm is proved. As an application we solve ...

Added: February 20, 2016

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

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

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